Earliest arrival flows in networks with multiple sinks

Authors:
Melanie Schmidt;Martin Skutella
Affiliations:
Lehrstuhl II, Fakultät für Informatik, Technische Universität Dortmund, Germany;Fakultät II, Institut für Mathematik, Technische Universität Berlin, Germany
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 8
Cited 0

Continuous-time flows in networks

Mathematics of Operations Research
Polynomial time algorithms for some evacuation problems

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Quickest Transshipment Problem

Mathematics of Operations Research
Faster Algorithms for the Quickest Transshipment Problem

SIAM Journal on Optimization
Approximating earliest arrival flows with flow-dependent transit times

Discrete Applied Mathematics
Quickest Flows Over Time

SIAM Journal on Computing
Earliest Arrival Flows with Multiple Sources

Mathematics of Operations Research
Efficient continuous-time dynamic network flow algorithms

Operations Research Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

Earliest arrival flows model a central aspect of evacuation planning: in a dangerous situation, as many individuals as possible should be rescued at any point in time. Unfortunately, given a network with multiple sinks, flows over time satisfying this condition do not always exist. We analyze the special case of flows over time with zero transit times and characterize which networks always allow for earliest arrival flows.