Shortest-path algorithms: Taxonomy and annotation
暂无分享,去创建一个
[1] E. Denardo,et al. Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..
[2] Donald E. Knuth,et al. A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..
[3] J. Y. Yen. An algorithm for finding shortest routes from all source nodes to a given destination in general networks , 1970 .
[4] Philip M. Spira,et al. A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n) , 1973, SIAM J. Comput..
[5] Jin Y. Yen,et al. Notes--On the Efficiency of a Direct Search Method to Locate Negative Cycles in a Network , 1972 .
[6] H. Joksch. The shortest route problem with constraints , 1966 .
[7] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[8] Douglas R. Shier,et al. Iterative methods for determining the k shortest paths in a network , 1976, Networks.
[9] A. Rosenthal. On finding shortest paths in nonnegative networks , 1974, Discret. Math..
[10] Yves Tabourier,et al. All shortest distances in a graph. An improvement to Dantzig's inductive algorithm , 1973, Discret. Math..
[11] Peter S Loubai. A NETWORK EVALUATION PROCEDURE , 1967 .
[12] G. Mills. A Decomposition Algorithm for the Shortest-Route Problem , 1966, Oper. Res..
[13] Robert B. Dial,et al. Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.
[14] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.
[15] B. L. Golden,et al. Shortest paths with euclidean distances: An explanatory model , 1978, Networks.
[16] Dirck Van Vliet,et al. IMPROVED SHORTEST PATH ALGORITHMS FOR TRANSPORT NETWORKS , 1978 .
[17] George J. Minty. Letter to the Editor—A Variant on the Shortest-Route Problem , 1957 .
[18] Alan Frieze,et al. Minimum Paths in Directed Graphs , 1977 .
[19] S. Clarke,et al. Computing the N Best Loopless Paths in a Network , 1963 .
[20] S. Verblunsky. On the shortest path through a number of points , 1951 .
[21] T. Ibaraki. Algorithms for Obtaining Shortest Paths Visiting Specified Nodes , 1973 .
[22] Takeshi Yoshimura,et al. Sparse matrix techniques for the shortest path problem , 1976 .
[23] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .
[24] Bernard M. Levin,et al. Determining fastest routes using fixed schedules , 1963, AFIPS '63 (Spring).
[25] Don L. Weimer. A serial technique to determine minimum paths , 1963, CACM.
[26] G. H. Bradley. Survey of Deterministic Networks , 1975 .
[27] John S. Carson,et al. A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem , 1977, SIAM J. Comput..
[28] Thomas L. Magnanti,et al. Deterministic network optimization: A bibliography , 1977, Networks.
[29] Maurice Pollack,et al. Letter to the Editor---Comments on “The Shortest-Route Problem” by Peart, Randolph, and Bartlett , 1961 .
[30] A. Land,et al. The Extension of the Cascade Algorithm to Large Graphs , 1967 .
[31] E. Minieka,et al. A Note on an Algebra for the k Best Routes in a Network , 1973 .
[32] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[33] Kohei Noshita,et al. On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs , 1978, Inf. Process. Lett..
[34] K. Cooke,et al. The shortest route through a network with time-dependent internodal transit times , 1966 .
[35] Takashi Nishimura,et al. The shortest route through a network by matrix method and its application to traffic assignment problem. , 1963 .
[36] Averill M. Law,et al. A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths , 1978, Networks.
[37] J. D. Murchland,et al. The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph , 1967 .
[38] G. Bennington. An Efficient Minimal Cost Flow Algorithm , 1973 .
[39] W A McLaughlin. MULTIPATH SYSTEM TRAFFIC ASSIGNMENT ALGORITHM , 1966 .
[40] Larry F. Butas,et al. A directionally oriented shortest path algorithm , 1968 .
[41] T. C. Hu. Revised Matrix Algorithms for Shortest Paths , 1967 .
[42] Emil Klafszky,et al. Determination of shortest path in a network with time-dependent edge-lengths 1 , 1972 .
[43] V. G. Cerf,et al. A lower bound on the average shortest path length in regular graphs , 1974, Networks.
[44] Uwe Pape. Letters to the Editor: Some Computational Notes on the Shortest Route Problem , 1968, Comput. J..
[45] Mario Nakamori. A NOTE ON THE OPTIMALITY OF SOME ALL-SHORTEST-PATH ALGORITHMS , 1972 .
[46] Dennis E. Blumenfeld,et al. Minimum-Cost Paths for a System Composed of Ordinary Routes and a Special Network of Cheap Routes , 1972 .
[47] Y. Aneja,et al. The constrained shortest path problem , 1978 .
[48] Andrés Weintraub. The shortest and the K-shortest routes as assignment problems , 1973, Networks.
[49] Jin Y. Yen. Technical Note - On Hu's Decomposition Algorithm for Shortest Paths in a Network , 1971, Oper. Res..
[50] John David Murchland,et al. A fixed matrix method for all shortest distances in a directed graph and for the inverse problem , 1970 .
[51] Tom Caldwell,et al. On finding minimum routes in a network with turn penalties , 1961, CACM.
[52] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[53] J. Croucher. A note on the stochastic shortest‐route problem , 1978 .
[54] Sheldon B. Akers,et al. A Modification of Lee's Path Connection Algorithm , 1967, IEEE Trans. Electron. Comput..
[55] George B. Dantzig,et al. THE APPLICATION OF DECOMPOSITION TO TRANSPORTATION NETWORK ANALYSIS , 1976 .
[56] Gregory P. White,et al. A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N-Node Nonnegative-Distance Networks , 1973, JACM.
[57] Paul H. Randolph,et al. Letter to the Editor—The Shortest-Route Problem , 1960 .
[58] George B. Dantzig,et al. ALL SHORTEST ROUTES IN A GRAPH , 1966 .
[59] G. Dantzig,et al. ALL SHORTEST ROUTES FROM A FIXED ORIGIN IN A GRAPH , 1966 .
[60] L. R. Ford,et al. NETWORK FLOW THEORY , 1956 .
[61] Jeremy F. Shapiro,et al. Shortest Route Methods for Finite State Space Deterministic Dynamic Programming Problems , 1968 .
[62] Jaroslav Morávek,et al. A note upon minimal path problem , 1970 .
[63] S. Okada,et al. ALGEBRAIC TECHNIQUES OF PATH FINDING AND MINIMUM PATH FINDING IN GRAPHS , 1963 .
[64] G. Nemhauser. A generalized permanent label setting algorithm for the shortest path between specified nodes , 1972 .
[65] Douglas R. Shier,et al. Computational experience with an algorithm for finding the k shortest paths in a network , 1974 .
[66] B. Fox. Calculating Kth Shortest Paths , 1973 .
[67] Richard Pavley,et al. A Method for the Solution of the Nth Best Path Problem , 1959, JACM.
[68] J. W. Suurballe. Disjoint paths in a network , 1974, Networks.
[69] P. Abramson,et al. An Analog Computer for Finding an Optimum Route Through a Communication Network , 1959 .
[70] Alan K. Halder. The Method of Competing Links , 1970 .
[71] Bruce L. Golden,et al. Technical Note - Shortest-Path Algorithms: A Comparison , 1976, Oper. Res..
[72] A. Bakó,et al. On the determination of the shortes path in a network having gains , 1973 .
[73] C. Y. Lee. An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..
[74] Michael Florian,et al. A Direct Search Method to Locate Negative Cycles in a Graph , 1971 .
[75] Thomas L. Magnanti,et al. TRANSPORTATION PLANNING: NETWORK MODELS AND THEIR IMPLEMENTATION , 1978 .
[76] Jonathan Halpern,et al. Shortest path with time constraints on movement and parking , 1974, Networks.
[77] R. Bellman,et al. On kth Best Policies , 1960 .
[78] Peter A. Steenbrink,et al. Optimization of Transport Networks , 1974 .
[79] U. Pape,et al. Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..
[80] V. Klee. A String Algorithm for Shortest Path in Directed Networks , 1964 .
[81] T. A. J. Nicholson,et al. Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..
[82] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.
[83] Jin Y. Yen,et al. Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using 12N3 Additions and N3 Comparisons , 1972, JACM.
[84] O. G. Alekseev,et al. An algorithm for determining the shortest path on a network graph , 1971 .
[85] T. C. Hu,et al. Tree decomposition algorithm for large networks , 1977, Networks.
[86] Gerald Hammer. Eine Bemerkung zum Tripel-Algorithmus zur Bestimmung der kürzesten Wege in einem Graphen , 1969 .
[87] S. N. Narahari Pandit,et al. Letter to the Editor---The Shortest-Route Problem---An Addendum , 1961 .
[88] Salah E. Elmaghraby,et al. The Theory of Networks and Management Science: Part II , 1970 .
[89] Darwin Klingman,et al. A Note on Finding All Shortest Paths , 1974 .
[90] B. Carré. An Algebra for Network Routing Problems , 1971 .
[91] M. Sakarovitch. The k shortest chains in a graph , 1968 .
[92] C. Y. Lee. A Note on the nth Shortest Path Problem , 1962, IRE Trans. Electron. Comput..
[93] J. A. Hillier,et al. A Method for Finding the Shortest Route Through a Road Network , 1960 .
[94] Alan J. Hoffman,et al. Finding all shortest distances in a directed network , 1972 .
[95] Harry M. Markowitz,et al. A note on shortest path, assignment, and transportation problems , 1963 .
[96] Ronald F. Kirby,et al. The minimum route problem for networks with turn penalties and prohibitions , 1969 .
[97] Bennett L. Fox. More on kth shortest paths , 1975, CACM.
[98] G. L. Nemhauser,et al. A Transport Improvement Problem Transformable to a Best-Path Problem , 1967, Transp. Sci..
[99] M. Pollack. Solutions of the kth best route through a network — A review , 1961 .
[100] G. Dantzig. Discrete-Variable Extremum Problems , 1957 .
[101] Jin Y. Yen. On Elmaghraby's “The Theory of Networks and Management Science” , 1971 .
[102] R. Kalaba. ON SOME COMMUNICATION NETWORK PROBLEMS , 1959 .
[103] Bennett L. Fox,et al. Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound , 1979, Oper. Res..
[104] Romesh Saigal,et al. Letter to the Editor - A Constrained Shortest Route Problem , 1968, Oper. Res..
[105] Donald B. Johnson,et al. A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.
[106] A. Pan,et al. On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..
[107] C. P. Bajaj,et al. Some constrained shortest-route problems , 1971, Unternehmensforschung.
[108] M. Pollack. Letter to the Editor—The kth Best Route Through a Network , 1961 .
[109] A. Rosenthal. A bit-pushing shortest distance algorithm , 1975, Networks.
[110] T. C. Hu. A Decomposition Algorithm for Shortest Paths in a Network , 1968, Oper. Res..
[111] Ahnont Wongseelashote,et al. An algebra for determining all path-values in a network with application to K-shortest-paths problems , 1976, Networks.
[112] Douglas R. Shier,et al. On algorithms for finding the k shortest paths in a network , 1979, Networks.
[113] Alberto L. Sangiovanni-Vincentelli,et al. A new shortest path updating algorithm , 1978, Networks.
[114] Alan M. Frieze. Shortest path algorithms for knapsack type problems , 1976, Math. Program..
[115] Michael L. Fredman,et al. New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..
[116] Masamitsu Mori,et al. Solution of the routing problem through a network by a matrix method with auxiliary nodes , 1967 .
[117] Ellis L. Johnson. On shortest paths and sorting , 1972, ACM Annual Conference.
[118] R. M. Oliver,et al. Flows in transportation networks , 1972 .
[119] Pitu B. Mirchandani,et al. Shortest distance and reliability of probabilistic networks , 1976, Comput. Oper. Res..
[120] A. Pierce. Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956-1974) , 1975, Networks.
[121] Karl N. Levitt,et al. Cellular arrays for the solution of graph problems , 1972, Commun. ACM.
[122] Bernard Roy. Combinatorial programming : methods and applications : proceedings of the NATO Advanced Study Institute held at the Palais des Congrès, Versailles, France, 2-13 September 1974 , 1975 .
[123] M. S. Bazaraa,et al. A Dual Shortest Path Algorithm , 1974 .
[124] T. C. Hu,et al. Shortcut in the decomposition algorithm for shortest paths in a network , 1969 .
[125] Bently A. Crane. Path Finding with Associative Memory , 1968, IEEE Transactions on Computers.
[126] Santosh Kumar,et al. The Routing Problem with "K" Specified Nodes , 1966, Oper. Res..
[127] Robert A. Wagner,et al. A Shortest Path Algorithm for Edge-Sparse Graphs , 1976, J. ACM.
[128] Laurence A. Wolsey,et al. Generalized dynamic programming methods in integer programming , 1973, Math. Program..
[129] G. Dantzig. On the Shortest Route Through a Network , 1960 .
[130] Maurice Pollack,et al. SOLUTIONS OF THE SHORTEST-ROUTE PROBLEM-A REVIEW , 1960 .
[131] B. Golden. Shortest-Path Algorithms: A Comparison , 1975 .
[132] Eugene L. Lawler. Comment on a computing the k shortest paths in a graph , 1977, CACM.
[133] Richard Pavley,et al. Applications of digital computers to problems in the study of vehicular traffic , 1958, IRE-ACM-AIEE '58 (Western).
[134] Donald B. Johnson,et al. Algorithms for Shortest Paths , 1973 .
[135] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.
[136] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[137] Marc Rosseel,et al. Letter to the Editor - Comments on a Paper By Romesh Saigal: "A Constrained Shortest Route Problem" , 1968, Oper. Res..
[138] Gideon Yuval,et al. An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications , 1976, Inf. Process. Lett..
[139] James S. Dyer,et al. Estimation of Travel Times in Multiple Mode Systems , 1971 .
[140] Frank O. Hadlock,et al. A shortest path algorithm for grid graphs , 1977, Networks.
[141] Kenneth L. Cooke,et al. Convergence of successive approximations in the shortest route problem , 1965 .
[142] V. V. Rodionov. The parametric problem of shortest distances , 1968 .
[143] Aarni Perko. Some Computational Notes on the Shortest Route Problem , 1965, Comput. J..
[144] Lewis E Hitchner. A COMPARATIVE INVESTIGATION OF THE COMPUTATIONAL EFFICIENCY OF SHORTEST PATH ALGORITHMS , 1968 .
[145] Rick Hesse. SOLUTION OF THE SHORTEST ROUTE PROBLEM USING THE ASSIGNMENT TECHNIQUE , 1972 .
[146] Brian Martin. Minimum Path Algorithms for Transportation Planning , 1963 .
[147] Edward Minieka,et al. On computing sets of shortest paths in a graph , 1974, Commun. ACM.
[148] H. Frank,et al. Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..