Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

We present a new family of shortest-route methods, which reduce an upper bound on running time, and make empirical comparisons for a certain class of networks. These methods also allow for exploitation of structure by pruning arcs and/or nodes.

[1]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[2]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

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

[4]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[5]  Lewis E Hitchner.  A COMPARATIVE INVESTIGATION OF THE COMPUTATIONAL EFFICIENCY OF SHORTEST PATH ALGORITHMS , 1968 .

[6]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[7]  G. Nemhauser,et al.  Discrete Dynamic Programming and Capital Allocation , 1969 .

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

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

[10]  G. Nemhauser,et al.  Integer Programming , 2020 .

[11]  Ellis L. Johnson.  On shortest paths and sorting , 1972, ACM Annual Conference.

[12]  Donald B. Johnson,et al.  A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.

[13]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

[15]  B. Golden.  Shortest-Path Algorithms: A Comparison , 1975 .

[16]  Robert A. Wagner,et al.  A Shortest Path Algorithm for Edge-Sparse Graphs , 1976, J. ACM.

[17]  Thomas L. Morin,et al.  Branch-and-Bound Strategies for Dynamic Programming , 2015, Oper. Res..

[18]  R. E. Marsten,et al.  An Algorithm for Nonlinear Knapsack Problems , 1976 .

[19]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[20]  Dirck Van Vliet,et al.  IMPROVED SHORTEST PATH ALGORITHMS FOR TRANSPORT NETWORKS , 1978 .

[21]  Bennett L. Fox,et al.  Data Structures and Computer Science Techniques in Operations Research , 1978, Oper. Res..

[22]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[23]  Bennett L. Fox,et al.  Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound , 1979, Oper. Res..