A computational study of efficient shortest path algorithms
From MaRDI portal
Publication:1112733
DOI10.1016/0305-0548(88)90052-4zbMath0659.90087MaRDI QIDQ1112733
Publication date: 1988
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(88)90052-4
sensitivity; threshold functions; computational comparisons; heaps; Curve fittings; Five efficient shortest path algorithms
Related Items
Extended dominance and a stochastic shortest path problem, Multiple UAVs path planning algorithms: a comparative study, Shortest path algorithms: A computational study with the C programming language, Some personal views on the current state and the future of locational analysis, Some new algorithms for location problems on networks, Intelligent transportation systems -- Enabling technologies, Shortest paths algorithms: Theory and experimental evaluation, Heuristic shortest path algorithms for transportation applications: state of the art, On the equivalence between some shortest path algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Network generation using the Prufer code
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A New Polynomially Bounded Shortest Path Algorithm
- Shortest‐path methods: Complexity, interrelations and new propositions
- New Polynomial Shortest Path Algorithms and Their Computational Attributes
- A shortest augmenting path method for solving minimal perfect matching problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Technical Note—Shortest-Path Algorithms: A Comparison
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Fibonacci heaps and their uses in improved network optimization algorithms
- An Appraisal of Some Shortest-Path Algorithms
