Path enumeration by finding the constrained K-shortest paths
Top Cited Papers
- 1 July 2005
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 39 (6), 545-563
- https://doi.org/10.1016/j.trb.2004.07.004
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Finding the k shortest pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On finding dissimilar pathsEuropean Journal of Operational Research, 2000
- Bicriterion Traffic Equilibrium: T2 Model, Algorithm, and Software OverviewTransportation Research Record: Journal of the Transportation Research Board, 2000
- An efficient implementation of an algorithm for findingK shortest simple pathsNetworks, 1999
- Finding the k Shortest PathsSIAM Journal on Computing, 1998
- A Comparative Study of k-Shortest Path AlgorithmsPublished by Springer Nature ,1996
- Shortest chain subject to side constraintsNetworks, 1983
- A dual algorithm for the constrained shortest path problemNetworks, 1980
- Data Structures and Computer Science Techniques in Operations ResearchOperations Research, 1978
- A note on two problems in connexion with graphsNumerische Mathematik, 1959