An Appraisal of Some Shortest-Path Algorithms

Stuart E. Dreyfus
Additional contact information
Stuart E. Dreyfus: University of California, Berkeley, California

Operations Research, 1969, vol. 17, issue 3, 395-412

Abstract: This paper treats five discrete shortest-path problems: (1) determining the shortest path between two specified nodes of a network; (2) determining the shortest paths between all pairs of nodes of a network; (3) determining the second, third, etc., shortest path; (4) determining the fastest path through a network with travel times depending on the departure time; and (5) finding the shortest path between specified endpoints that passes through specified intermediate nodes. Existing good algorithms are identified while some others are modified to yield efficient procedures. Also, certain misrepresentations and errors in the literature are demonstrated.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (44)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.3.395 (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:17:y:1969:i:3:p:395-412

Access Statistics for this article

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