Sink location to find optimal shelters in evacuation planning
DOI10.1007/S13675-015-0054-7zbMATH Open1349.90562OpenAlexW2265384047MaRDI QIDQ339937FDOQ339937
Authors: Philipp Heßler, Horst W. Hamacher 
Publication date: 11 November 2016
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-39344
Recommendations
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Multiple sink location problems in dynamic path networks
- Multiple sink location problems in dynamic path networks
- Minsum \(k\)-sink problem on dynamic flow path networks
- Dynamic network flow location models and algorithms for quickest evacuation planning
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- `` Strong NP-Completeness Results
- Multi-Terminal Network Flows
- Title not available (Why is that?)
- Pre-positioning planning for emergency response with service quality constraints
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Title not available (Why is that?)
- Simultaneous source location
- Sink location to find optimal shelters in evacuation planning
- Minimum Cost Source Location Problems with Flow Requirements
- The root location problem for arc-disjoint arborescences
- Static and dynamic source locations in undirected networks
Cited In (4)
This page was built for publication: Sink location to find optimal shelters in evacuation planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339937)
