Abstract network flow with intermediate storage for evacuation planning
From MaRDI portal
Publication:2103018
DOI10.1016/j.ejor.2022.06.054OpenAlexW4283733415MaRDI QIDQ2103018
Tanka Nath Dhamala, Urmila Pyakurel, Durga Prasad Khanal
Publication date: 12 December 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.06.054
Related Items (5)
FlowLoc problems with maximum excess flow ⋮ Decomposition of probability marginals for security games in abstract networks ⋮ A joint demand and supply management approach to large scale urban evacuation planning: evacuate or shelter-in-place, staging and dynamic resource allocation ⋮ In memoriam: Urmila Pyakurel (1980--2023) ⋮ Efficient algorithms for abstract flow with partial switching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- A survey of dynamic network flows
- Complexity analysis for maximum flow problems with arc reversals
- Modeling of building evacuation problems by network flows with side constraints
- Efficient continuous-time dynamic network flow algorithms
- Energy management for stationary electric energy storage systems: a systematic literature review
- Continuous time dynamic contraflow models and algorithms
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- Network flow with intermediate storage: models and algorithms
- Abstract flows over time: a first step towards solving dynamic packing problems
- Relief distribution networks: a systematic review
- Partial contraflow with path reversals for evacuation planning
- Optimising shelter location and evacuation routing operations: the critical issues
- A comprehensive survey on the quickest path problem
- Efficient continuous contraflow algorithms for evacuation planning problems
- OR/MS research in disaster operations management
- A survey on models and algorithms for discrete evacuation planning network problems
- Dynamics of disasters -- key concepts, models, algorithms, and insights. Selected papers based on the presentations at the 2nd international conference, Kalamata, Greece, June 29 -- July 2015, 2015
- Maximal Flow Through a Network
- A Polynomial Algorithm for Weighted Abstract Flow
- The building evacuation problem with shared information
- The quickest flow problem
- Maximal, Lexicographic, and Dynamic Network Flows
- A generalization of max flow—min cut
This page was built for publication: Abstract network flow with intermediate storage for evacuation planning
