On the equivalence between some shortest path algorithms

DOI10.1016/0167-6377(91)90088-7zbMath0717.90079OpenAlexW2009776058MaRDI QIDQ2638955

Hanif D. Sherali

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90088-7

zbMATH Keywords

Moore's algorithmPartitioned Shortest Path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• A computational study of efficient shortest path algorithms
• On a routing problem
• A New Polynomially Bounded Shortest Path Algorithm
• 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: On the equivalence between some shortest path algorithms