A note on the partitioning shortest path algorithm
- 30 September 1987
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 6 (4) , 183-187
- https://doi.org/10.1016/0167-6377(87)90017-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Shortest path methods: A unifying approachPublished by Springer Nature ,1986
- New Polynomial Shortest Path Algorithms and Their Computational AttributesManagement Science, 1985
- A New Polynomially Bounded Shortest Path AlgorithmOperations Research, 1985
- Properties of Labeling Methods for Determining Shortest Path TreesJournal of Research of the National Bureau of Standards, 1981
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974