An Algorithm for Universal Maximal Dynamic Flows in a Network

DOI10.1287/opre.19.7.1602zbMath0244.90013OpenAlexW2126469728MaRDI QIDQ5656577

W. L. Wilkinson

Publication date: 1971

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

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

Mathematics Subject Classification ID

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

Related Items (30)

Evacuation planning by earliest arrival contraflow ⋮ Earliest Arrival Flows in Networks with Multiple Sinks ⋮ Algorithms for Flows over Time with Scheduling Costs ⋮ Route-based signal preemption control of emergency vehicle ⋮ On continuous network flows ⋮ DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS ⋮ Approximating earliest arrival flows with flow-dependent transit times ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ Algorithms for the quickest time distribution of dynamic stochastic-flow networks ⋮ Minimum cost dynamic flows: The series-parallel case ⋮ Unnamed Item ⋮ An Introduction to Network Flows over Time ⋮ A survey of dynamic network flows ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Network flow with intermediate storage: models and algorithms ⋮ Earliest arrival flows in networks with multiple sinks ⋮ Universally maximum flow with piecewise-constant capacities ⋮ Time-varying universal maximum flow problems ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Minsum \(k\)-sink problem on path networks ⋮ Engpässe, Staustellen und glatte homogene Ströme in Netzen ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Earliest arrival flows on series-parallel graphs ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ Traffic Networks and Flows over Time ⋮ Efficient continuous-time dynamic network flow algorithms ⋮ Algorithms for flows over time with scheduling costs

This page was built for publication: An Algorithm for Universal Maximal Dynamic Flows in a Network