Reoptimization procedures in shortest path problem
- 1 March 1980
- journal article
- research article
- Published by Springer Science and Business Media LLC in Decisions in Economics and Finance
- Vol. 3 (1), 3-13
- https://doi.org/10.1007/bf02092136
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- Improved shortest path algorithms for transport networksTransportation Research, 1978
- An improved linear approximation algorithm for the network equilibrium (packet switching) problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- A Unified Approach to Equilibrium Methods for Traffic AssignmentPublished by Springer Science and Business Media LLC ,1976
- A Dual Shortest Path AlgorithmSIAM Journal on Applied Mathematics, 1974
- A performance comparison of labeling algorithms for calculating shortest path treesPublished by National Institute of Standards and Technology (NIST) ,1973
- A generalized permanent label setting algorithm for the shortest path between specified nodesJournal of Mathematical Analysis and Applications, 1972
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- On the Shortest Route Through a NetworkManagement Science, 1960