Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
From MaRDI portal
(Redirected from Publication:5086009)
Recommendations
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- Time-dependent shortest path problems with penalties and limits on waiting
- Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
- The time-dependent shortest path and vehicle routing problem
Cites work
- A time bucket formulation for the traveling salesman problem with time windows
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- On a routing problem
- On the complexity of time-dependent shortest paths
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- The Continuous-Time Service Network Design 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
Cited in
(5)- Perspectives on integer programming for time-dependent models
- Rejoinder on: ``Perspectives on integer programming for time-dependent models
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- An exact algorithm for the service network design problem with hub capacity constraints
- A review of recent advances in time-dependent vehicle routing
This page was built for publication: Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086009)
