Earliest arrival flows in networks with multiple sinks

DOI10.1016/j.dam.2011.09.023zbMath1326.90014OpenAlexW2178582903MaRDI QIDQ496688

Martin Skutella, Melanie Schmidt

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.023

zbMATH Keywords

earliest arrival flowevacuation problemflow over time

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Flow control and optimization for compressible fluids and gas dynamics (76N25)

Related Items (3)

Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) ⋮ Lexicographically optimal earliest arrival flows ⋮ Evacuation network optimization model with Lane-based reversal and routing

Cites Work

• Unnamed Item
• Approximating earliest arrival flows with flow-dependent transit times
• Transient flows in networks
• Efficient continuous-time dynamic network flow algorithms
• Faster Algorithms for the Quickest Transshipment Problem
• The Quickest Transshipment Problem
• An Introduction to Network Flows over Time
• Earliest Arrival Flows with Multiple Sources
• Optimal dynamic routing in communication networks with continuous traffic
• The quickest flow problem
• Maximal, Lexicographic, and Dynamic Network Flows
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Continuous-Time Flows in Networks

This page was built for publication: Earliest arrival flows in networks with multiple sinks