An Appraisal of Some Shortest-Path Algorithms
暂无分享,去创建一个
[1] L. R. Ford,et al. NETWORK FLOW THEORY , 1956 .
[2] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[3] D. R. Fulkerson,et al. Constructing Maximal Dynamic Flows from Static Flows , 1958 .
[4] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[5] Richard Pavley,et al. A Method for the Solution of the Nth Best Path Problem , 1959, JACM.
[6] G. Dantzig. On the Shortest Route Through a Network , 1960 .
[7] J. A. Hillier,et al. A Method for Finding the Shortest Route Through a Road Network , 1960 .
[8] Maurice Pollack,et al. SOLUTIONS OF THE SHORTEST-ROUTE PROBLEM-A REVIEW , 1960 .
[9] R. Bellman,et al. On kth Best Policies , 1960 .
[10] M. Pollack. Letter to the Editor—The kth Best Route Through a Network , 1961 .
[11] M. Pollack. Solutions of the kth best route through a network — A review , 1961 .
[12] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.
[13] Stephen J. Garland,et al. Algorithm 97: Shortest path , 1962, Commun. ACM.
[14] S. Clarke,et al. Computing the N Best Loopless Paths in a Network , 1963 .
[15] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[16] T. A. J. Nicholson,et al. Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..
[17] K. Cooke,et al. The shortest route through a network with time-dependent internodal transit times , 1966 .
[18] Santosh Kumar,et al. The Routing Problem with "K" Specified Nodes , 1966, Oper. Res..
[19] T. C. Hu. Revised Matrix Algorithms for Shortest Paths , 1967 .
[20] A. Land,et al. The Extension of the Cascade Algorithm to Large Graphs , 1967 .
[21] T. C. Hu. A Decomposition Algorithm for Shortest Paths in a Network , 1968, Oper. Res..
[22] Lewis E Hitchner. A COMPARATIVE INVESTIGATION OF THE COMPUTATIONAL EFFICIENCY OF SHORTEST PATH ALGORITHMS , 1968 .
[23] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..