Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning

DOI10.1007/s10479-011-0953-9zbMath1272.90024OpenAlexW2065247511MaRDI QIDQ367642

Stephanie Heller, Benjamin Rupp, Horst W. Hamacher

Publication date: 16 September 2013

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

Full work available at URL: https://doi.org/10.1007/s10479-011-0953-9

zbMATH Keywords

location theorymatroidsevacuation planning(dynamic) network flowsmulti-terminal flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85)

Related Items (15)

Efficient contraflow algorithms for quickest evacuation planning ⋮ Risk-based models for emergency shelter and exit design in buildings ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Efficient continuous contraflow algorithms for evacuation planning problems ⋮ Dynamic network flow location models and algorithms for quickest evacuation planning ⋮ A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow ⋮ Static and dynamic source locations in undirected networks ⋮ FlowLoc problems with maximum excess flow ⋮ Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach ⋮ In memoriam: Urmila Pyakurel (1980--2023) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Partial contraflow with path reversals for evacuation planning ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Abstract network flow with intermediate storage for evacuation planning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal dynamic polymatroid flows and applications
• Algebraic flows in regular matroids
• Deterministic network interdiction
• The Multi Terminal q-FlowLoc Problem: A Heuristic
• Minimal cost flows in regular matroids
• The quickest flow problem
• Shortest-path network interdiction
• Two-Person Zero-Sum Games for Network Interdiction
• Optimal interdiction of a supply network
• An Algorithm for Universal Maximal Dynamic Flows in a Network

This page was built for publication: Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning