论文信息 - On algorithms for finding the k shortest paths in a network - 字舞流文

On algorithms for finding the k shortest paths in a network

Douglas R. Shier | D. Shier

[1] Douglas R. Shier,et al. Iterative methods for determining the k shortest paths in a network , 1976, Networks.

[2] Bennett L. Fox. More on kth shortest paths , 1975, CACM.

[3] U. Pape,et al. Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[4] Douglas R. Shier,et al. Computational experience with an algorithm for finding the k shortest paths in a network , 1974 .

[5] Edward Minieka,et al. On computing sets of shortest paths in a graph , 1974, Commun. ACM.

[6] E. Minieka,et al. A Note on an Algebra for the k Best Routes in a Network , 1973 .

[7] B. Fox. Calculating Kth Shortest Paths , 1973 .

[8] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[9] R. M. Oliver,et al. Flows in transportation networks , 1972 .

[10] J. Y. Yen. Finding the K Shortest Loopless Paths in a Network , 1971 .

[11] Robert B. Dial,et al. Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[12] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[13] M. Pollack. Solutions of the kth best route through a network — A review , 1961 .

[14] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.