Expected shortest paths in dynamic and stochastic traffic networks
- 1 September 1998
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 32 (7), 499-516
- https://doi.org/10.1016/s0191-2615(98)00016-2
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A New Algorithm for Shortest Paths in Discrete Dynamic NetworksIFAC Proceedings Volumes, 1997
- A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path ProblemsTransportation Science, 1996
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- The Fastest Path through a Network with Random Time-Dependent Travel TimesTransportation Science, 1986
- Optimal paths in graphs with stochastic or multidimensional weightsCommunications of the ACM, 1983
- Shortest distance and reliability of probabilistic networksComputers & Operations Research, 1976
- Shortest Paths in Probabilistic GraphsOperations Research, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958