A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- 1 September 1979
- Vol. 9 (3), 215-248
- https://doi.org/10.1002/net.3230090304
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network CodeOperations Research, 1976
- Past, present and future of large scale transshipment computer codes and applicationsComputers & Operations Research, 1975
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution ProblemsJournal of the ACM, 1972
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Revised Matrix Algorithms for Shortest PathsSIAM Journal on Applied Mathematics, 1967
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- A High-Speed Computer Technique for the Transportation ProblemJournal of the ACM, 1958