Time-varying shortest path problems with
β
Cai, X.; Kloks, T.; Wong, C. K.
π
Article
π
1997
π
John Wiley and Sons
π
English
β 159 KB
We study a new version of the shortest path problem. Let G Γ (V, E) be a directed graph. Each arc e β E has two numbers attached to it: a transit time b(e, u) and a cost c(e, u), which are functions of the departure time u at the beginning vertex of the arc. Moreover, postponement of departure (i.e.