Continuous dynamic contraflow approach for evacuation planning
From MaRDI portal
Publication:2399339
DOI10.1007/S10479-016-2302-5zbMATH Open1377.90102OpenAlexW2514431748MaRDI QIDQ2399339FDOQ2399339
Authors: Urmila Pyakurel, Tanka Nath Dhamala 
Publication date: 22 August 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2302-5
Recommendations
- Continuous time dynamic contraflow models and algorithms
- Dynamic network contraflow evacuation planning problem with continuous time approach
- Efficient continuous contraflow algorithms for evacuation planning problems
- Evacuation planning by earliest arrival contraflow
- Dynamic contraflow with orientation dependent transit times allowing intermediate storage
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- An Algorithm for a Class of Continuous Linear Programs
- Continuous-Time Flows in Networks
- Efficient continuous-time dynamic network flow algorithms
- Combinatorial Optimization with Rational Objective Functions
- The quickest flow problem
- Transient flows in networks
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- A comprehensive survey on the quickest path problem
- A survey on models and algorithms for discrete evacuation planning network problems
- Earliest Arrival Flows with Multiple Sources
- Constructing maximal dynamic flows from static flows
- Title not available (Why is that?)
- OR/MS research in disaster operations management
- A survey of dynamic network flows
- Title not available (Why is that?)
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- Earliest arrival flows on series-parallel graphs
- Universally maximum flow with piecewise-constant capacities
- Optimal dynamic routing in communication networks with continuous traffic
- Complexity analysis for maximum flow problems with arc reversals
- Title not available (Why is that?)
- A Class of Continuous Network Flow Problems
- The building evacuation problem with shared information
- The quickest transshipment problem
- Maximal, Lexicographic, and Dynamic Network Flows
- Evacuation planning by earliest arrival contraflow
- Continuous dynamic contraflow approach for evacuation planning
- Title not available (Why is that?)
- Approximating Earliest Arrival Flows in Arbitrary Networks
- Earliest arrival flows in networks with multiple sinks
Cited In (22)
- Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm
- Multi-commodity flow problem on lossy network with partial lane reversals
- Bi‐level programming based contra flow optimization for evacuation events
- Evacuation planning by earliest arrival contraflow
- Continuous time dynamic contraflow models and algorithms
- Maximum contraflow evacuation planning problems on multi-network
- Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning
- Large‐scale zone‐based evacuation planning—Part I: Models and algorithms
- Disaster Influencing Migratory Movements: A System Dynamics Analysis
- Continuous dynamic contraflow approach for evacuation planning
- Efficient contraflow algorithms for quickest evacuation planning
- A critical survey on the network optimization algorithms for evacuation planning problems
- Dynamic network contraflow evacuation planning problem with continuous time approach
- In memoriam: Urmila Pyakurel (1980--2023)
- <scp>Large‐scale</scp> zone‐based evacuation planning, Part <scp>II</scp>: Macroscopic and microscopic evaluations
- Efficient continuous contraflow algorithms for evacuation planning problems
- Dynamic network flow location models and algorithms for quickest evacuation planning
- Sink Evacuation on Trees with Dynamic Confluent Flows
- Dynamic contraflow with orientation dependent transit times allowing intermediate storage
- Network flow with intermediate storage: models and algorithms
- Partial contraflow with path reversals for evacuation planning
- Generalized maximum flow over time with intermediate storage
This page was built for publication: Continuous dynamic contraflow approach for evacuation planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399339)
