Time-varying shortest path problems with constraints
From MaRDI portal
Publication:4347281
DOI<141::AID-NET2>3.0.CO;2-H 10.1002/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-HzbMath0876.05060OpenAlexW1987916269MaRDI QIDQ4347281
No author found.
Publication date: 7 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199705)29:3<141::aid-net2>3.0.co;2-h
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Discrete location and assignment (90B80)
Related Items (16)
Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem ⋮ Dynamic shortest path problems with time-varying costs ⋮ Path Problems in Complex Networks ⋮ Routing of a hazmat truck in the presence of weather systems ⋮ A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits ⋮ On the complexity of time-dependent shortest paths ⋮ Processing time-dependent shortest path queries without pre-computed speed information on road networks ⋮ Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network ⋮ Dynamic journeying under uncertainty ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Time-varying minimum cost flow problems ⋮ Unnamed Item ⋮ Solving the \(k\)-shortest path problem with time windows in a time varying network ⋮ Computation of the optimal value function in time-dependent networks ⋮ Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem ⋮ Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
This page was built for publication: Time-varying shortest path problems with constraints
