Shortest path algorithms: A computational study with the C programming language
DOI10.1016/0305-0548(91)90014-IzbMath0741.90084OpenAlexW2034710274MaRDI QIDQ1184466
Jean-François Mondou, Teodor Gabriel Crainic, Sang Nguyen
Publication date: 28 June 1992
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(91)90014-i
Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A computational study of efficient shortest path algorithms
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- On a routing problem
- Faster algorithms for the shortest path problem
- A New Polynomially Bounded Shortest Path Algorithm
- Shortest path methods: A unifying approach
- New Polynomial Shortest Path Algorithms and Their Computational Attributes
- Algorithm 562: Shortest Path Lengths [H]
- Properties of Labeling Methods for Determining Shortest Path Trees
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: Shortest path algorithms: A computational study with the C programming language
