A Note on Finding All Shortest Paths

Fred Glover, D. Klingman and A. Napier
Additional contact information
Fred Glover: University of Colorado, Boulder, Colorado
D. Klingman: University of Texas, Austin, Texas
A. Napier: Continental Oil Company, Houston, Texas

Transportation Science, 1974, vol. 8, issue 1, 3-12

Abstract: We present a procedure for finding the shortest routes between all pathconnected ordered pairs of nodes in a network. Furthermore, our approach is quite simple and highly efficient for a special class of network problems. In particular, this class of networks subsumes a number that appear in real world applications. For instance, the Polish government and the Texas Water Resources Developmental Board have developed water resource analysis models that are in this class.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.8.1.3 (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:ortrsc:v:8:y:1974:i:1:p:3-12

Access Statistics for this article

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