Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects
- 1 January 1998
- book chapter
- other
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 48 references indexed in Scilit:
- Polynomial auction algorithms for shortest pathsComputational Optimization and Applications, 1995
- Hyperpaths and shortest hyperpathsLecture Notes in Mathematics, 1989
- Computational study of an improved shortest path algorithmNetworks, 1984
- A dual simplex algorithm for finding all shortest pathsNetworks, 1981
- A note on finding shortest path treesNetworks, 1981
- A note on the problem of updating shortest pathsNetworks, 1981
- Reoptimization procedures in shortest path problemDecisions in Economics and Finance, 1980
- Improved shortest path algorithms for transport networksTransportation Research, 1978
- The minimum route problem for networks with turn penalties and prohibitionsTransportation Research, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959