On the equivalence between some shortest path algorithms

DOI10.1016/0167-6377(91)90088-7MaRDI QIDQ2638955zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On the complexity of equal shortest path routing
• An Appraisal of Some Shortest-Path Algorithms
• Shortest paths algorithms: Theory and experimental evaluation
• scientific article; zbMATH DE number 1003284
• Computing almost shortest paths (extended abstract)
• Computing almost shortest paths
• Approximating Shortest Paths in Graphs
• Shortest‐path methods: Complexity, interrelations and new propositions
• scientific article; zbMATH DE number 3871984
• Shortest path methods: A unifying approach

Cites work

• A computational study of efficient shortest path algorithms
• A New Polynomially Bounded Shortest Path Algorithm
• scientific article; zbMATH DE number 3334757 (Why is no real title available?)
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• On a routing problem
• Properties of Labeling Methods for Determining Shortest Path Trees

Cited in

(2)

• Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
• Note on ``A new bidirectional algorithm for shortest paths

This page was built for publication: On the equivalence between some shortest path algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638955)