Affordable Access

Publisher Website

Earliest Arrival Flows in Networks with Multiple Sinks

Authors
Journal
Electronic Notes in Discrete Mathematics
1571-0653
Publisher
Elsevier
Publication Date
Volume
36
Identifiers
DOI: 10.1016/j.endm.2010.05.077
Keywords
  • Earliest Arrival Flow
  • Flow Over Time
  • Evacuation Problems

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.