Optimal Network Capacity Planning: A Shortest-Path Scheme

P. J. Doulliez and M. R. Rao
Additional contact information
P. J. Doulliez: Societé de Traction et d'Electricité, Brussels, Belgium
M. R. Rao: University of Rochester, Rochester, New York

Operations Research, 1975, vol. 23, issue 4, 810-818

Abstract: The sequential decision problem considered in this paper consists of finding an optimal policy for increasing the capacity of a multi-terminal network with requirements increasing over a planning period and arcs subject to failure. This problem is formulated as a shortest-route problem in a very large network and solved by Dijkstra's algorithm. Computational experience is also presented.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.4.810 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:23:y:1975:i:4:p:810-818

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().