Shortest paths in a network with time-dependent flow speeds
Authors:
- Kiseok SungKSKiseok Sung
- Michael G.H BellMBMichael G.H Bell
- Myeongki SeongMSMyeongki Seong
- Soondal ParkSPSoondal Park
- 1 February 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 121 (1) , 32-39
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets1997
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- The shortest route through a network with time-dependent internodal transit timesJournal of Mathematical Analysis and Applications, 1966
- On a routing problemQuarterly of Applied Mathematics, 1958