Dynamic shortest path problems with time-varying costs

DOI10.1007/s11590-009-0162-5zbMath1181.90047OpenAlexW1996702143MaRDI QIDQ845562

S. Mehdi Hashemi, Ebrahim Nasrabadi, Shaghayegh Mokarami

Publication date: 29 January 2010

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0162-5

zbMATH Keywords

labeling algorithmstime-varying networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Minimum cost paths over dynamic networks ⋮ On solving continuous-time dynamic network flows ⋮ Adaptive image interpolation by cardinal splines in piecewise constant tension ⋮ A minmax regret version of the time-dependent shortest path problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuous-time shortest path problems with stopping and starting costs
• Negative-cycle detection algorithms
• A finite-time algorithm for shortest path problems with time-varying costs
• 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
• Minimum weight paths in time-dependent networks
• Continuous-Time Shortest Path Problems and Linear Programming
• Time-varying shortest path problems with constraints
• Dynamic shortest paths minimizing travel times and costs
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Dynamic shortest path problems with time-varying costs