A note on the partitioning shortest path algorithm
From MaRDI portal
Publication:1101020
DOI10.1016/0167-6377(87)90017-4zbMath0641.90083MaRDI QIDQ1101020
Publication date: 1987
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/2461
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
Related Items
A column generation approach to the heterogeneous fleet vehicle routing problem, The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A New Polynomially Bounded Shortest Path Algorithm
- Shortest path methods: A unifying approach
- New Polynomial Shortest Path Algorithms and Their Computational Attributes
- New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures
- Properties of Labeling Methods for Determining Shortest Path Trees
- Implementation and efficiency of Moore-algorithms for the shortest route problem