On the use of network flow techniques for assigning evacuees to exits
Authors:
- Daniel DresslerDDDaniel Dressler
- Martin GroßMGMartin Groß
- Jan-Philipp KappmeierJKJan-Philipp Kappmeier
- Timon KelterTKTimon Kelter
- Joscha KulbatzkiJKJoscha Kulbatzki
- Daniel PlümpeDPDaniel Plümpe
- Gordon SchlechterGSGordon Schlechter
- Melanie SchmidtMSMelanie Schmidt
- Martin SkutellaMSMartin Skutella
- Sylvie TemmeSTSylvie Temme
Open Access
- 1 January 2010
- journal article
- Published by Elsevier in Procedia Engineering
- Vol. 3, 205-215
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Earliest Arrival Flows with Multiple SourcesMathematics of Operations Research, 2009
- Traffic Networks and Flows over Time2009
- Simulation of pedestrian dynamics using a two-dimensional cellular automatonPhysica A: Statistical Mechanics and its Applications, 2001
- On Implementing the Push—Relabel Method for the Maximum Flow ProblemAlgorithmica, 1997
- Modeling of building evacuation problems by network flows with side constraintsEuropean Journal of Operational Research, 1988
- Network models for building evacuationFire Technology, 1982
- A "Uniformity Principle" for Evacuation Route AllocationJournal of Research of the National Bureau of Standards, 1981
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956