A New Polynomially Bounded Shortest Path Algorithm

F. Glover, D. Klingman and N. Phillips
Additional contact information
F. Glover: University of Colorado, Boulder, Colorado
D. Klingman: University of Texas, Austin, Texas
N. Phillips: University of Texas, Austin, Texas

Operations Research, 1985, vol. 33, issue 1, 65-73

Abstract: This paper develops a new polynomially bounded shortest path algorithm, called the partitioning shortest path (PSP) algorithm, for finding the shortest path from one node to all other nodes in a network containing no cycles with negative lengths. This new algorithm includes as variants the label setting algorithm, many of the label correcting algorithms, and the apparently computationally superior threshold algorithm.

Keywords: 483 shortest path algorithms; 833 design of mass transit systems (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.1.65 (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:33:y:1985:i:1:p:65-73

Access Statistics for this article

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