A note on the partitioning shortest path algorithm

DOI10.1016/0167-6377(87)90017-4zbMath0641.90083OpenAlexW2071925433MaRDI QIDQ1101020

Martin Desrochers

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/2461

zbMATH Keywords

detection of negative length cyclesPartitioning Shortest Pathsharp labels

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

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

This page was built for publication: A note on the partitioning shortest path algorithm