Time-dependent shortest path problems with penalties and limits on waiting
From MaRDI portal
Publication:5085472
Recommendations
- Time-dependent shortest paths with discounted waits
- Time-varying shortest path problems with constraints
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- Optimising waiting at nodes in time-dependent networks: cost functions and applications
- scientific article; zbMATH DE number 1114039
Cites work
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- On the complexity of time-dependent shortest paths
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- The exact path length problem.
- The shortest route through a network with time-dependent internodal transit times
- Time depending shortest-path problems with applications to railway networks
- Time-dependent shortest paths with discounted waits
- Travel time estimation in the age of big data
- Vehicle dispatching with time-dependent travel times
Cited in
(6)- A minmax regret version of the time-dependent shortest path problem
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- Time-dependent shortest paths with discounted waits
- The multi-period \(p\)-center problem with time-dependent travel times
- scientific article; zbMATH DE number 6913891 (Why is no real title available?)
- Shortest path with acceleration constraints: complexity and approximation algorithms
This page was built for publication: Time-dependent shortest path problems with penalties and limits on waiting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085472)
