Earliest Arrival Flows in Networks with Multiple Sinks

DOI10.1016/J.ENDM.2010.05.077zbMath1237.90053OpenAlexW2080979706MaRDI QIDQ2883623

Melanie Schmidt

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.077

zbMATH Keywords

earliest arrival flowflow over timeevacuation problems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (3)

Evacuation planning by earliest arrival contraflow ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Unnamed Item

Cites Work

• Transient flows in networks
• Faster Algorithms for the Quickest Transshipment Problem
• The Quickest Transshipment Problem
• An Introduction to Network Flows over Time
• Earliest Arrival Flows with Multiple Sources
• Maximal, Lexicographic, and Dynamic Network Flows
• Quickest Flows Over Time
• An Algorithm for Universal Maximal Dynamic Flows in a Network

This page was built for publication: Earliest Arrival Flows in Networks with Multiple Sinks