Maximal, Lexicographic, and Dynamic Network Flows
From MaRDI portal
Publication:4065257
DOI10.1287/opre.21.2.517zbMath0307.90025OpenAlexW2047907098MaRDI QIDQ4065257
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.2.517
Related Items
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, Modeling of building evacuation problems by network flows with side constraints, Approximating earliest arrival flows with flow-dependent transit times, Continuous dynamic contraflow approach for evacuation planning, A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs, Minimum cost dynamic flows: The series-parallel case, FlowLoc problems with maximum excess flow, Lexicographically optimal earliest arrival flows, The quickest flow problem, Unnamed Item, An Introduction to Network Flows over Time, A survey of dynamic network flows, Rerouting Flows when Links Fail, 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, The DT-polynomial approach to discrete time-varying network flow problems, Minsum \(k\)-sink problem on path networks, Partial contraflow with path reversals for evacuation planning, A survey on models and algorithms for discrete evacuation planning network problems, Network redesign for efficient crowd flow and evacuation, The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths, Optimal building evacuation time considering evacuation routes, Earliest arrival flows on series-parallel graphs, Dynamic Atomic Congestion Games with Seasonal Flows, Traffic Networks and Flows over Time, A network flow approach to a city emergency evacuation planning, Maximum-throughput dynamic network flows, Efficient continuous-time dynamic network flow algorithms, Abstract network flow with intermediate storage for evacuation planning, Algorithms for flows over time with scheduling costs
