Computational study of an improved shortest path algorithm
- 1 March 1984
- Vol. 14 (1), 25-36
- https://doi.org/10.1002/net.3230140103
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A new algorithm to find the shortest paths between all pairs of nodesDiscrete Applied Mathematics, 1982
- A dual simplex algorithm for finding all shortest pathsNetworks, 1981
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- Technical Note—Shortest-Path Algorithms: A ComparisonOperations Research, 1976
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974
- A performance comparison of labeling algorithms for calculating shortest path treesPublished by National Institute of Standards and Technology (NIST) ,1973
- On shortest paths and sortingPublished by Association for Computing Machinery (ACM) ,1972
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963