A heuristic improvement of the Bellman-Ford algorithm
- 1 May 1993
- journal article
- Published by Elsevier in Applied Mathematics Letters
- Vol. 6 (3) , 3-6
- https://doi.org/10.1016/0893-9659(93)90022-f
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Shortest‐path methods: Complexity, interrelations and new propositionsNetworks, 1984
- Properties of Labeling Methods for Determining Shortest Path TreesJournal of Research of the National Bureau of Standards, 1981
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958