Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
From MaRDI portal
Publication:5086009
DOI10.1287/ijoc.2021.1084OpenAlexW4200413328MaRDI QIDQ5086009
Natashia Boland, Nemhauser, George I., Savelsbergh, Martin W. P., Edward He
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1084
time discretizationtime-dependent travel timesdynamic discretization discoverytime-expanded networksfastest pathsminimum duration paths
Related Items (3)
An exact algorithm for the service network design problem with hub capacity constraints ⋮ Perspectives on integer programming for time-dependent models ⋮ Rejoinder on: ``Perspectives on integer programming for time-dependent models
Cites Work
- Unnamed Item
- On the complexity of time-dependent shortest paths
- Time depending shortest-path problems with applications to railway networks
- The shortest route through a network with time-dependent internodal transit times
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
- On a routing problem
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- The Continuous-Time Service Network Design Problem
- Time‐dependent shortest paths with discounted waits
This page was built for publication: Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems