Continuous time dynamic contraflow models and algorithms
From MaRDI portal
Publication:1748504
DOI10.1155/2016/7902460zbMath1387.90054OpenAlexW2322227392WikidataQ59122802 ScholiaQ59122802MaRDI QIDQ1748504
Tanka Nath Dhamala, Urmila Pyakurel
Publication date: 11 May 2018
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/7902460
Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items (10)
Efficient contraflow algorithms for quickest evacuation planning ⋮ Efficient continuous contraflow algorithms for evacuation planning problems ⋮ Dynamic network flow location models and algorithms for quickest evacuation planning ⋮ A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow ⋮ Multi-commodity flow problem on lossy network with partial lane reversals ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Network flow with intermediate storage: models and algorithms ⋮ Partial contraflow with path reversals for evacuation planning ⋮ Abstract network flow with intermediate storage for evacuation planning
Cites Work
- Unnamed Item
- Complexity analysis for maximum flow problems with arc reversals
- Efficient continuous-time dynamic network flow algorithms
- Evacuation planning by earliest arrival contraflow
- Earliest arrival flows on series-parallel graphs
- A Class of Continuous Network Flow Problems
- The quickest flow problem
- Constructing Maximal Dynamic Flows from Static Flows
This page was built for publication: Continuous time dynamic contraflow models and algorithms