An Improved Solution Algorithm for the Constrained Shortest Path Problem

[1]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[2]  Erik Rolland,et al.  Efficient Algorithms for Solving the Shortest Covering Path Problem , 1994, Transp. Sci..

[3]  E. Martins,et al.  A computational improvement for a shortest paths ranking algorithm , 1994 .

[4]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[5]  E. Martins,et al.  An algorithm for the ranking of shortest paths , 1993 .

[6]  E. Martins.  An algorithm for ranking paths that may contain cycles , 1984 .

[7]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[8]  Charles ReVelle,et al.  SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER.: THE SHORTEST COVERING PATH PROBLEM: AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN , 1984 .

[9]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[10]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[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]  H. Joksch.  The shortest route problem with constraints , 1966 .

[14]  D. R. Fulkerson,et al.  Flows in Networks , 1963 .

[15]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

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

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

[18]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[19]  James Evans,et al.  Optimization algorithms for networks and graphs , 1992 .

[20]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[21]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[22]  G. Dantzig.  On the Shortest Route Through a Network , 1960 .