A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits

DOI10.1002/net.21994MaRDI QIDQ6087122

Jérémy Omer, Michael Poss

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

breakpointconcavityshortest pathstime-dependent networkslabel-setting algorithmswait

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• On the complexity of time-dependent shortest paths
• Shortest paths in piecewise continuous time-dependent networks
• The shortest route through a network with time-dependent internodal transit times
• On a routing problem
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Minimum weight paths in time-dependent networks
• Time-varying shortest path problems with constraints
• Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
• Dynamic shortest paths minimizing travel times and costs
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• Time‐dependent shortest paths with discounted waits
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits