摘要: This paper presents an algorithm for finding the K loopless paths that have shortest lengths from one node to another in a network. The significance of new is its computational upper bound increases only linearly with value K. Consequently, general, extremely efficient as compared algorithms proposed by Bock, Kantner, and Haynes [2], Pollack [7], [8], Clarke, Krikorian, Rausan [3], Sakarovitch [9] others. first reviews presently available terms effort memory addresses they require. followed presentation justification. Finally, efficiency examined other algorithms.
jstor.org 
sci-hub.se 参考文章(7)
S. Clarke, A. Krikorian, J. Rausen, Computing the N Best Loopless Paths in a Network Journal of the Society for Industrial and Applied Mathematics. ,vol. 11, pp. 1096- 1102 ,(1963) , 10.1137/0111081
Richard Bellman, Robert Kalaba, On kth Best Policies Journal of The Society for Industrial and Applied Mathematics. ,vol. 8, pp. 582- 588 ,(1960) , 10.1137/0108044
Maurice Pollack, Letter to the Editor—Thekth Best Route Through a Network Operations Research. ,vol. 9, pp. 578- 580 ,(1961) , 10.1287/OPRE.9.4.578
Walter Hoffman, Richard Pavley, A Method for the Solution of the Nth Best Path Problem Journal of the ACM. ,vol. 6, pp. 506- 514 ,(1959) , 10.1145/320998.321004
Stuart E. Dreyfus, An Appraisal of Some Shortest-Path Algorithms Operations Research. ,vol. 17, pp. 395- 412 ,(1969) , 10.1287/OPRE.17.3.395
E. W. Dijkstra, A note on two problems in connexion with graphs Numerische Mathematik. ,vol. 1, pp. 269- 271 ,(1959) , 10.1007/BF01386390
Jin Y. Yen, An algorithm for finding shortest routes from all source nodes to a given destination in general networks Quarterly of Applied Mathematics. ,vol. 27, pp. 526- 530 ,(1970) , 10.1090/QAM/253822