A New Algorithm for Shortest Paths in Discrete Dynamic Networks
- 1 June 1997
- journal article
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 30 (8), 537-542
- https://doi.org/10.1016/s1474-6670(17)43876-6
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Vehicle-routeing with Time Windows and Time-varying CongestionJournal of the Operational Research Society, 1991
- Minimum weight paths in time‐dependent networksNetworks, 1991
- Shortest path algorithmsAnnals of Operations Research, 1988
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- The shortest route through a network with time-dependent internodal transit timesJournal of Mathematical Analysis and Applications, 1966
- A note on two problems in connexion with graphsNumerische Mathematik, 1959