Dynamic network contraflow evacuation planning problem with continuous time approach
From MaRDI portal
Recommendations
- Continuous dynamic contraflow approach for evacuation planning
- Continuous time dynamic contraflow models and algorithms
- Efficient continuous contraflow algorithms for evacuation planning problems
- Maximum contraflow evacuation planning problems on multi-network
- Dynamic contraflow with orientation dependent transit times allowing intermediate storage
Cites work
- A Class of Continuous Network Flow Problems
- A survey on models and algorithms for discrete evacuation planning network problems
- Complexity analysis for maximum flow problems with arc reversals
- Constructing maximal dynamic flows from static flows
- Continuous and discrete flows over time
- Continuous-Time Flows in Networks
- Efficient continuous-time dynamic network flow algorithms
- Finding minimum-cost circulations by canceling negative cycles
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 934458 (Why is no real title available?)
- On solving continuous-time dynamic network flows
Cited in
(8)- Continuous time dynamic contraflow models and algorithms
- Efficient algorithms for abstract flow with partial switching
- Continuous dynamic contraflow approach for evacuation planning
- Efficient continuous contraflow algorithms for evacuation planning problems
- Bi‐level programming based contra flow optimization for evacuation events
- Maximum contraflow evacuation planning problems on multi-network
- A critical survey on the network optimization algorithms for evacuation planning problems
- Dynamic contraflow with orientation dependent transit times allowing intermediate storage
This page was built for publication: Dynamic network contraflow evacuation planning problem with continuous time approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020873)
