A Class of Label-Correcting Methods for the K Shortest Paths Problem
Published Online:1 Jun 2001https://doi.org/10.1287/opre.49.3.423.11217
Supplemental Material
opre.49.3.423-sm.pdf (57 KB)
- Cited by
- 25 July 2024 | Algorithms, Vol. 17, No. 8
- 8 March 2024 | Networks and Spatial Economics, Vol. 24, No. 2
- 22 May 2024 | Algorithms, Vol. 17, No. 6
- 29 March 2023 | PLOS ONE, Vol. 18, No. 3
- Engineering Applications of Artificial Intelligence, Vol. 87
- 18 July 2015 | Computational Optimization and Applications, Vol. 63, No. 2
- 2 March 2014 | Journal of Geographical Systems, Vol. 16, No. 3
- 27 February 2013 | International Transactions in Operational Research, Vol. 19, No. 1-2
- Modelling and Simulation in Engineering, Vol. 2012
- IEEE Transactions on Automation Science and Engineering, Vol. 7, No. 1
- 27 June 2007 | OR Spectrum, Vol. 30, No. 3
Volume 49, Issue 3
May-June 2001
Pages 325-468
Article Information
Supplemental Material
Metrics
Information
- Received:March 01, 1998
- Accepted:January 01, 2000
- Published Online:June 01, 2001
© 2001 INFORMS
Cite as
Francesca Guerriero, Roberto Musmanno, Valerio Lacagnina, Antonio Pecorella, (2001) A Class of Label-Correcting Methods for the K Shortest Paths Problem. Operations Research 49(3):423-429.
https://doi.org/10.1287/opre.49.3.423.11217
Keywords
