A finite-time algorithm for shortest path problems with time-varying costs
- 1 March 1993
- journal article
- Published by Elsevier BV in Applied Mathematics Letters
- Vol. 6 (2), 91-94
- https://doi.org/10.1016/0893-9659(93)90020-n
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Continuous-time shortest path problems with stopping and starting costsApplied Mathematics Letters, 1992
- Minimum weight paths in time‐dependent networksNetworks, 1991
- Railway scheduling by network optimizationMathematical and Computer Modelling, 1991