Minimum cost paths over dynamic networks

DOI10.1016/J.ENDM.2016.03.045MaRDI QIDQ325482zbMATH OpenOpenAlexFDO

Authors Enrico Grande, Gaia Nicosia, Andrea Pacifici

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)

Recommendations

• Cheapest paths in dynamic networks
• scientific article; zbMATH DE number 1918689
• Minimum cost time-varying network flow problems
• Optimal flows in dynamic networks and algorithms for their finding
• Minimum cost multicommodity flows in dynamic networks and algorithms for their findings

Cites work

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

Cited in

(18)

• Dynamic minimum cost path problem with curfews
• Partially dynamic maintenance of minimum weight hyperpaths
• Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks
• Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
• Minimum weight paths in time-dependent networks
• On minimum reload cost paths, tours, and flows
• New complexity results for time-constrained dynamical optimal path problems
• scientific article; zbMATH DE number 6393860 (Why is no real title available?)
• Minimum cost path problems with relays
• An exact algorithm for a multicommodity min-cost flow over time problem
• Minimum Cost Routing on Stochastic Networks
• Cheapest paths in dynamic networks
• Dynamic shortest paths minimizing travel times and costs
• A note on the minimum instantaneous cost path of the dynamic traffic assignment problem
• Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
• scientific article; zbMATH DE number 2079322 (Why is no real title available?)
• An approximation algorithm for discrete minimum cost flows over time problem
• scientific article; zbMATH DE number 1783111 (Why is no real title available?)

This page was built for publication: Minimum cost paths over dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325482)