Path enumeration by finding the constrained K-shortest paths

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

[2]  Richard Pavley,et al.  A Method for the Solution of the Nth Best Path Problem , 1959, JACM.

[3]  R. Bellman,et al.  On kth Best Policies , 1960 .

[4]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[5]  Douglas R. Shier,et al.  Iterative methods for determining the k shortest paths in a network , 1976, Networks.

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

[7]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

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

[9]  Toshihide Ibaraki,et al.  An efficient algorithm for K shortest simple paths , 1982, Networks.

[10]  Y. P. Aneja,et al.  Shortest chain subject to side constraints , 1983, Networks.

[11]  T de la Barra,et al.  Multidimensional path search and assignment , 1993 .

[12]  M. C. Sinclair,et al.  A Comparative Study of k-Shortest Path Algorithms , 1996 .

[13]  David Bernstein,et al.  FINDING ALTERNATIVES TO THE BEST PATH , 1997 .

[14]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[15]  Nicos Christofides,et al.  An efficient implementation of an algorithm for finding K shortest simple paths , 1999, Networks.

[16]  Robert B. Dial,et al.  Bicriterion Traffic Equilibrium: T2 Model, Algorithm, and Software Overview , 2000 .

[17]  Erhan Erkut,et al.  On finding dissimilar paths , 2000, Eur. J. Oper. Res..

[18]  S F Catalano,et al.  A FORECASTING MODEL FOR INLAND NAVIGATION BASED ON ROUTE ENUMERATION , 2001 .