Minimum cost paths over dynamic networks

DOI10.1016/j.endm.2016.03.045zbMath1351.90049OpenAlexW2405644299MaRDI QIDQ325482

Andrea Pacifici, Gaia Nicosia, Enrico Grande

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.045

zbMATH Keywords

computational complexitydynamic networksflows over time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

An exact algorithm for a multicommodity min-cost flow over time problem

Cites Work

• Dynamic shortest path problems with time-varying costs
• An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
• Computation of the optimal value function in time-dependent networks
• Projected Perspective Reformulations with Applications in Design Problems
• New complexity results for time-constrained dynamical optimal path problems
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Minimum weight paths in time-dependent networks
• Approximation Schemes for the Restricted Shortest Path Problem
• Minimum-cost dynamic flows: The series-parallel case