Minimum cost paths over dynamic networks

DOI10.1016/J.ENDM.2016.03.045zbMATH Open1351.90049OpenAlexW2405644299MaRDI QIDQ325482FDOQ325482

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

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

zbMATH Keywords

computational complexitydynamic networksflows over time

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

• Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks
• Dynamic shortest paths minimizing travel times and costs
• On minimum reload cost paths, tours, and flows
• Title not available (Why is that?)
• Partially dynamic maintenance of minimum weight hyperpaths
• New complexity results for time-constrained dynamical optimal path problems
• A note on the minimum instantaneous cost path of the dynamic traffic assignment problem
• Dynamic minimum cost path problem with curfews
• Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
• Cheapest paths in dynamic networks
• Title not available (Why is that?)
• Minimum cost path problems with relays
• Title not available (Why is that?)
• Minimum Cost Routing on Stochastic Networks
• An exact algorithm for a multicommodity min-cost flow over time problem

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)