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

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

Cited in

(30)

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

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)