Evacuation planning by earliest arrival contraflow
From MaRDI portal
Publication:2358500
DOI10.3934/jimo.2016028zbMath1365.90041OpenAlexW2312978142MaRDI QIDQ2358500
Tanka Nath Dhamala, Urmila Pyakurel
Publication date: 15 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016028
Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items
Efficient contraflow algorithms for quickest evacuation planning, 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, FlowLoc problems with maximum excess flow, In memoriam: Urmila Pyakurel (1980--2023), Unnamed Item, Continuous time dynamic contraflow models and algorithms, Partial contraflow with path reversals for evacuation planning
Cites Work
- Unnamed Item
- Complexity analysis for maximum flow problems with arc reversals
- Efficient continuous-time dynamic network flow algorithms
- A survey on models and algorithms for discrete evacuation planning network problems
- The Quickest Transshipment Problem
- Earliest Arrival Flows in Networks with Multiple Sinks
- Approximating Earliest Arrival Flows in Arbitrary Networks
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Earliest arrival flows on series-parallel graphs
- Earliest Arrival Flows with Multiple Sources
- Finding minimum-cost circulations by canceling negative cycles
- The quickest flow problem
- Maximal, Lexicographic, and Dynamic Network Flows
- Constructing Maximal Dynamic Flows from Static Flows
- An Algorithm for Universal Maximal Dynamic Flows in a Network
