Shortest path algorithms: A computational study with the C programming language

DOI10.1016/0305-0548(91)90014-IMaRDI QIDQ1184466zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

shortest pathscomputational efficiencyredistributive heap algorithm

Mathematics Subject Classification ID

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)

Recommendations

• Computational efficiency of shortest path algorithms in C language
• A computational study of efficient shortest path algorithms
• scientific article; zbMATH DE number 1003284
• Shortest paths algorithms: Theory and experimental evaluation
• Comparative analysis of new simplex-type algorithms for shortest path problems

Cites work

• scientific article; zbMATH DE number 3815002 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3783030 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A New Polynomially Bounded Shortest Path Algorithm
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• A computational study of efficient shortest path algorithms
• A note on two problems in connexion with graphs
• Algorithm 562: Shortest Path Lengths [H]
• Faster algorithms for the shortest path problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• New Polynomial Shortest Path Algorithms and Their Computational Attributes
• On a routing problem
• Properties of Labeling Methods for Determining Shortest Path Trees
• Shortest path methods: A unifying approach
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

Cited in

(4)

• Computational efficiency of shortest path algorithms in C language
• Extended dominance and a stochastic shortest path problem
• Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
• Shortest paths algorithms: Theory and experimental evaluation

Describes a project that uses

Uses Software

• Algorithm 360

This page was built for publication: Shortest path algorithms: A computational study with the C programming language

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