×

On algorithms for finding the k shortest paths in a network. (English) Zbl 0414.68034


MSC:

68R10 Graph theory (including graph drawing) in computer science
94C15 Applications of graph theory to circuits and networks
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Dial, Comm. ACM 12 pp 632– (1969)
[2] Dijkstra, Num. Math. 1 pp 269– (1959)
[3] Dreyfus, Operations Research 17 pp 395– (1969)
[4] Fox, INFOR. 11 pp 66– (1973)
[5] Fox, Comm. ACM. 18 pp 279– (1975)
[6] and , ”A Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees”, Technical Note 772, National Bureau of Standards, Washington, D.C., 1973.
[7] ”A Comparative Investigation of the Computational Efficiency of Shortest Path Algorithms”, Report ORC 68–25, Operations Research Center, University of California, Berkeley, 1968.
[8] Lawler, Management Science 18 pp 401– (1972)
[9] Combinatorial Optimization, Holt, Reinhart and Winston, New York, 1976.
[10] Minieka, Comm. ACM 17 pp 351– (1974)
[11] Minieka, J. Inst. Math. Appl. 11 pp 145– (1973)
[12] Pape, Mathematical Programming 7 pp 212– (1974)
[13] Pollack, J. Math. Anal. Appl. 3 pp 547– (1961)
[14] and , Flows in Transportation Networks, Academic Press, N.Y., 1972. · Zbl 0246.90010
[15] ”An Algorithm for Finding the k Shortest Paths in a Graph”, Working Paper, IBM Systems Development Division, Poughkeepsie, N.Y., 1975.
[16] Shier, J. Res. Natl. Bur. Stand. 78B pp 139– (1974) · Zbl 0301.90046 · doi:10.6028/jres.078B.020
[17] Shier, Networks 6 pp 205– (1976)
[18] ”On a Group Theoretic Approach to Linear Integer Programming”, Report ORC 66–27, Operations Research Center, University of California, Berkeley, 1966.
[19] ”Some Algorithms for Finding the Shortest Routes Through the General Networks”, and (Eds.), Computing Methods in Optimization Problems - 2, Academic Press, N.Y. 1969, 377–388.
[20] Yen, Management Science 17 pp 712– (1971) · Zbl 0227.90048
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.