Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
DOI10.1007/S10479-011-0953-9zbMATH Open1272.90024OpenAlexW2065247511MaRDI QIDQ367642FDOQ367642
Authors: 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
Recommendations
- Dynamic network flow location models and algorithms for quickest evacuation planning
- Sink location to find optimal shelters in evacuation planning
- A network flow approach to a city emergency evacuation planning
- Minsum \(k\)-sink problem on dynamic flow path networks
- Maximum FlowLoc problems with network reconfiguration
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Deterministic network interdiction
- The quickest flow problem
- Two-Person Zero-Sum Games for Network Interdiction
- Title not available (Why is that?)
- Shortest-path network interdiction
- Optimal interdiction of a supply network
- Maximal dynamic polymatroid flows and applications
- Algebraic flows in regular matroids
- The multi terminal \(q\)-FlowLoc problem: a heuristic
- Title not available (Why is that?)
- Minimal cost flows in regular matroids
- An Algorithm for Universal Maximal Dynamic Flows in a Network
Cited In (26)
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- The multi terminal \(q\)-FlowLoc problem: a heuristic
- Title not available (Why is that?)
- Model and solution for non-conservation flow evacuation planning problem
- On the use of lexicographic min cost flows in evacuation modeling
- Locating flow-intercepting facilities: New approaches and results
- Risk-based models for emergency shelter and exit design in buildings
- An effective bilevel programming approach for the evasive flow capturing location problem
- FlowLoc problems with maximum excess flow
- Maximum FlowLoc problems with network reconfiguration
- Continuous dynamic contraflow approach for evacuation planning
- The flow-capturing location-allocation model with risk bottleneck limitation
- Efficient contraflow algorithms for quickest evacuation planning
- A critical survey on the network optimization algorithms for evacuation planning problems
- Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach
- In memoriam: Urmila Pyakurel (1980--2023)
- Dynamic network flow models of sustainable grain silo location
- Robust flows with losses and improvability in evacuation planning
- Sink location to find optimal shelters in evacuation planning
- Efficient continuous contraflow algorithms for evacuation planning problems
- Dynamic network flow location models and algorithms for quickest evacuation planning
- Static and dynamic source locations in undirected networks
- A survey on models and algorithms for discrete evacuation planning network problems
- Abstract network flow with intermediate storage for evacuation planning
- Scheduling-location algorithms with applications in evacuation planning
- Partial contraflow with path reversals for evacuation planning
This page was built for publication: Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367642)
