Time-varying shortest path problems with constraints
From MaRDI portal
Publication:4347281
Recommendations
Cited in
(31)- Computation of the optimal value function in time-dependent networks
- Solving the \(k\)-shortest path problem with time windows in a time varying network
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- Continuous-time shortest path problems with stopping and starting costs
- Routing of a hazmat truck in the presence of weather systems
- Variants of shortest path problems
- Dynamic journeying under uncertainty
- On the complexity of time-dependent shortest paths
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- Shortest path problems with left-side time windows
- Approximation solutions for time-varying shortest path problem
- Flows over time in time-varying networks: optimality conditions and strong duality
- The time-varying shortest path problem with fuzzy transit costs and speedup
- A dynamic programming solution of a shortest path problem with time constraints on movement and parking
- On the complexity of time-dependent shortest paths
- Time-dependent shortest paths with discounted waits
- Time-dependent shortest path problems with penalties and limits on waiting
- Dynamic shortest path problems with time-varying costs
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
- The approach‐dependent, time‐dependent, label‐constrained shortest path problem
- Path Problems in Complex Networks
- Processing time-dependent shortest path queries without pre-computed speed information on road networks
- scientific article; zbMATH DE number 6913891 (Why is no real title available?)
- Minimum time paths in a network with mixed time constraints.
- Time-varying minimum cost flow problems
- Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Time-varying shortest path problem with curfews
- Optimising waiting at nodes in time-dependent networks: cost functions and applications
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
This page was built for publication: Time-varying shortest path problems with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347281)