Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
From MaRDI portal
(Redirected from Publication:367642)
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
Cites work
- scientific article; zbMATH DE number 1714716 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 5772890 (Why is no real title available?)
- Algebraic flows in regular matroids
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- Deterministic network interdiction
- Maximal dynamic polymatroid flows and applications
- Minimal cost flows in regular matroids
- Network flows. Theory, algorithms, and applications.
- Optimal interdiction of a supply network
- Shortest-path network interdiction
- The multi terminal q-FlowLoc problem: a heuristic
- The quickest flow problem
- Two-Person Zero-Sum Games for Network Interdiction
Cited in
(30)- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- The multi terminal q-FlowLoc problem: a heuristic
- scientific article; zbMATH DE number 1714717 (Why is no real title available?)
- Submodularity property for facility locations of dynamic flow networks
- 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
- Maximum dynamic FlowLoc with intermediate storage: a temporally repeated approach
- 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
- Continuous dynamic contraflow approach for evacuation planning
- Maximum FlowLoc problems with network reconfiguration
- The flow-capturing location-allocation model with risk bottleneck limitation
- On the quickest evacuation location problem in humanitarian operations: multi-objective modelling and matheuristic solution
- 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
- Robust flows with losses and improvability in evacuation planning
- Sink location to find optimal shelters in evacuation planning
- Dynamic network flow models of sustainable grain silo location
- In memoriam: Urmila Pyakurel (1980--2023)
- Efficient continuous contraflow algorithms for evacuation planning problems
- Static and dynamic source locations in undirected networks
- Dynamic network flow location models and algorithms for quickest evacuation planning
- 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
- Prioritized Max-FlowLoc 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)
