Evacuation modeling: a case study on linear and nonlinear network flow models
From MaRDI portal
Publication:339928
DOI10.1007/s13675-015-0055-6zbMath1349.90166OpenAlexW2173093191WikidataQ60471923 ScholiaQ60471923MaRDI QIDQ339928
Jan Peter Ohst, Stefan Ruzika, Sebastian Kühn, Simone Goettlich
Publication date: 11 November 2016
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-015-0055-6
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items
DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Cauchy problem at a node with buffer
- Optimization for a special class of traffic flow models: combinatorial and continuous approaches
- Modeling of building evacuation problems by network flows with side constraints
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Efficient continuous-time dynamic network flow algorithms
- Evacuation dynamics influenced by spreading hazardous material
- A novel model for intersections of vehicular traffic flow
- The quickest flow problem
- High-Resolution Nonoscillatory Central Schemes with Nonstaggered Grids for Hyperbolic Conservation Laws
- Modeling, Simulation, and Optimization of Traffic Flow Networks
- Traffic Flow on a Road Network
This page was built for publication: Evacuation modeling: a case study on linear and nonlinear network flow models