An Algorithm for Universal Maximal Dynamic Flows in a Network

DOI10.1287/OPRE.19.7.1602MaRDI QIDQ5656577zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(33)

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

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

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