A New Polynomially Bounded Shortest Path Algorithm

This paper develops a new polynomially bounded shortest path algorithm, called the partitioning shortest path PSP algorithm, for finding the shortest path from one node to all other nodes in a network containing no cycles with negative lengths. This new algorithm includes as variants the label setting algorithm, many of the label correcting algorithms, and the apparently computationally superior threshold algorithm.

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

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

[3]  Fred W. Glover,et al.  Computational study of an improved shortest path algorithm , 1984, Networks.

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

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

[6]  J. Y. Yen.  An algorithm for finding shortest routes from all source nodes to a given destination in general networks , 1970 .

[7]  J. A. Hillier,et al.  A Method for Finding the Shortest Route Through a Road Network , 1960 .

[8]  Giorgio Gallo,et al.  A new algorithm to find the shortest paths between all pairs of nodes , 1982, Discret. Appl. Math..

[9]  Stefano Pallottino,et al.  Shortest-path methods: Complexity, interrelations and new propositions , 1984, Networks.

[10]  L FoxBennett,et al.  Shortest-Route Methods , 1979 .

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

[12]  Douglas R. Shiert,et al.  Properties of Labeling Methods for Determining Shortest Path Trees , 1981 .

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

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

[15]  Sang Nguyen,et al.  A dual simplex algorithm for finding all shortest paths , 1981, Networks.