Constructing Maximal Dynamic Flows from Static Flows

DOI10.1287/opre.6.3.419zbMath1414.90066OpenAlexW2076171427MaRDI QIDQ5378808

Publication date: 3 June 2019

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.6.3.419

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Directed graphs (digraphs), tournaments (05C20)

Related Items (86)

Evacuation planning by earliest arrival contraflow ⋮ Minimax problem of suppressing a communication network ⋮ On the complexity and approximability of budget-constrained minimum cost flows ⋮ Flows in strongly regular periodic dynamic resource networks ⋮ Multiple sink location problem in path networks with a combinational objective ⋮ Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Algorithms for Flows over Time with Scheduling Costs ⋮ Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations ⋮ Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure ⋮ The mixed evacuation problem ⋮ Multicommodity flows over time: Efficient algorithms and complexity ⋮ On continuous network flows ⋮ Dealing with time in the multiple traveling salespersons problem with moving targets ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks ⋮ A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization ⋮ An adaptive routing approach for personal rapid transit ⋮ A model-based approach and analysis for multi-period networks ⋮ Approximating earliest arrival flows with flow-dependent transit times ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Efficient continuous contraflow algorithms for evacuation planning problems ⋮ Synchronized Traveling Salesman Problem ⋮ On the Price of Anarchy for Flows over Time ⋮ Braess's paradox for flows over time ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ Dynamic network flow location models and algorithms for quickest evacuation planning ⋮ A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow ⋮ A capacitated network flow optimization approach for short notice evacuation planning ⋮ Static and dynamic source locations in undirected networks ⋮ Minimum cost dynamic flows: The series-parallel case ⋮ Maritime inventory routing: recent trends and future directions ⋮ Dynamic flows with time-dependent capacities ⋮ Equilibria in routing games with edge priorities ⋮ An exact algorithm for the service network design problem with hub capacity constraints ⋮ A note on the quickest minimum cost transshipment problem ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Scalable timing-aware network design via Lagrangian decomposition ⋮ Multiple sink location problems in dynamic path networks ⋮ Pattern-based evacuation planning for urban areas ⋮ The Maximum Energy-Constrained Dynamic Flow Problem ⋮ Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach ⋮ Unnamed Item ⋮ Ship Traffic Optimization for the Kiel Canal ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An introduction to dynamic generative networks: minimum cost flow ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ A polynomial time algorithm for the minimum flow problem in time-varying networks ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Stable flows over time ⋮ Computational complexity of convoy movement planning problems ⋮ Earliest arrival flows in networks with multiple sinks ⋮ An exact algorithm for a multicommodity min-cost flow over time problem ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Continuous time dynamic contraflow models and algorithms ⋮ A network simplex method for the budget-constrained minimum cost flow problem ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Minimum flow problem on network flows with time-varying bounds ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Unnamed Item ⋮ Robust flows over time: models and complexity results ⋮ A tight bound on the speed-up through storage for quickest multi-commodity flows ⋮ Minimax regret 1-median problem in dynamic path networks ⋮ Minsum \(k\)-sink problem on path networks ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ Minimax regret vertex 2-sink location problem in dynamic path networks ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Unnamed Item ⋮ Fleet management for autonomous vehicles using flows in time-expanded networks ⋮ Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks ⋮ Subset Selection in Sparse Matrices ⋮ Min-Cost Flow in Unit-Capacity Planar Graphs ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities ⋮ Discrete Newton methods for the evacuation problem ⋮ A decomposition-based approach for the multiperiod multiproduct distribution planning problem ⋮ Maximin problem of communication network synthesis ⋮ Heterogeneous multi-commodity network flows over time ⋮ Minimax regret 1-sink location problem in dynamic path networks ⋮ Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems ⋮ Vehicle dispatching with time-dependent travel times ⋮ Algorithms for flows over time with scheduling costs ⋮ Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

This page was built for publication: Constructing Maximal Dynamic Flows from Static Flows