Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems

DOI10.1287/IJOC.2021.1084OpenAlexW4200413328MaRDI QIDQ5086009FDOQ5086009

Authors: Edward He, Natashia Boland, G. L. Nemhauser, Martin W. P. Savelsbergh 

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

zbMATH Keywords

time discretizationtime-dependent travel timesdynamic discretization discoverytime-expanded networksfastest pathsminimum duration paths

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Title not available (Why is that?)
• On a routing problem
• The shortest route through a network with time-dependent internodal transit times
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• On the complexity of time-dependent shortest paths
• Time depending shortest-path problems with applications to railway networks
• A time bucket formulation for the traveling salesman problem with time windows
• The Continuous-Time Service Network Design Problem
• Time-dependent shortest paths with discounted waits

Cited In (3)

• Perspectives on integer programming for time-dependent models
• Rejoinder on: ``Perspectives on integer programming for time-dependent models
• An exact algorithm for the service network design problem with hub capacity constraints

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)