Earliest Arrival Flows with Multiple Sources

DOI10.1287/moor.1090.0382zbMath1218.90166OpenAlexW2147567448MaRDI QIDQ3169047

Martin Skutella, Nadine Baumann

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7ce05e3bb2ed88af105b8f1b3b214e768b477163

zbMATH Keywords

network flowearliest arrival flowevacuation problemflow over time

Mathematics Subject Classification ID

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 (23)

Evacuation planning by earliest arrival contraflow ⋮ Earliest Arrival Flows in Networks with Multiple Sinks ⋮ Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) ⋮ Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations ⋮ The mixed evacuation problem ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) ⋮ Online scheduling problems with flexible release dates: applications to infrastructure restoration ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Evacuating two robots from multiple unknown exits in a circle ⋮ Lexicographically optimal earliest arrival flows ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ Temporal flows in temporal networks ⋮ Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach ⋮ Unnamed Item ⋮ Earliest arrival flows in networks with multiple sinks ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Evacuation network optimization model with Lane-based reversal and routing ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ A Stackelberg strategy for routing flow over time ⋮ Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks ⋮ The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths ⋮ Discrete Newton methods for the evacuation problem

This page was built for publication: Earliest Arrival Flows with Multiple Sources