scientific article; zbMATH DE number 1714716
From MaRDI portal
Publication:2776597
Recommendations
- Modeling of building evacuation problems by network flows with side constraints
- scientific article; zbMATH DE number 3912063
- scientific article; zbMATH DE number 1714717
- Crowd flow control in a building during evacuation
- Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\)
Cited in
(82)- Optimal building evacuation time considering evacuation routes
- On performance measures for evacuation systems
- A simulation model for emergency evacuation
- Models of wayfinding in emergency evacuations
- Efficient contraflow algorithms for quickest evacuation planning
- Routing and scheduling on evacuation path networks using centralized hybrid approach
- Solving the bus evacuation problem and its variants
- The energy-constrained quickest path problem
- Ranking robustness and its application to evacuation planning
- Emergency evacuation of hazardous chemical accidents based on diffusion simulation
- Integrated optimal scheduling of repair crew and relief vehicle after disaster
- Bi-objective safe and resilient urban evacuation planning
- Dealing with residual energy when transmitting data in energy-constrained capacitated networks
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
- A capacitated network flow optimization approach for short notice evacuation planning
- Evacuation dynamics influenced by spreading hazardous material
- Optimal egress time calculation and path generation for large evacuation networks
- Simultaneous evacuation and entrance planning in complex building based on dynamic network flows
- A heuristic algorithm for the earliest arrival flow with multiple sources
- An optimization model for the evacuation time in the presence of delay
- Abstract network flow with intermediate storage for evacuation planning
- Solving the absolute 1-center problem in the quickest path case
- System of integrated simulation of spread of hazardous factors of fire and evacuation of people from indoors
- Modeling emergency response operations: a theory building survey
- Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study
- Minsum \(k\)-sink problem on path networks
- Partial contraflow with path reversals for evacuation planning
- Discrete Newton methods for the evacuation problem
- A-RESCUE: an agent based regional evacuation simulator coupled with user enriched behavior
- Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\)
- Continuous dynamic contraflow approach for evacuation planning
- Efficient continuous contraflow algorithms for evacuation planning problems
- Fibonacci helps to evacuate from a convex region in a grid network
- Algorithms for time-dependent bicriteria shortest path problems
- A systematic comparison of buildingEXODUS predictions with experimental data from the Stapelfeldt trials and the Milburn House evacuation
- A survey on models and algorithms for discrete evacuation planning network problems
- Crowd flow control in a building during evacuation
- Risk-awareness in multi-level building evacuation with smoke: Burj Khalifa case study
- scientific article; zbMATH DE number 1714717 (Why is no real title available?)
- Emergency evacuation model of urban rail transit station based on dynamic switching pattern
- Distributed Evacuation in Graphs with Multiple Exits
- Scheduling evacuation operations
- Modeling and optimizing traffic light settings in road networks
- Evacuation modeling: a case study on linear and nonlinear network flow models
- Robust flows with losses and improvability in evacuation planning
- Sink location to find optimal shelters in evacuation planning
- Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
- The building evacuation problem with shared information
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- scientific article; zbMATH DE number 3912063 (Why is no real title available?)
- A novel method for planning a staged evacuation
- Pattern-based evacuation planning for urban areas
- A stochastic programming approach for shelter location and evacuation planning
- An exact network flow formulation for cell-based evacuation in urban areas
- Decision support for hospital evacuation and emergency response
- A robust bus evacuation model with delayed scenario information
- A critical survey on the network optimization algorithms for evacuation planning problems
- DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
- An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks
- A pilgrim scheduling approach to increase safety during the Hajj
- Optimal evacuation solutions for large-scale scenarios
- Lexicographically optimal earliest arrival flows
- Large‐scale zone‐based evacuation planning—Part I: Models and algorithms
- Quantitative comparison between crowd models for evacuation planning and evaluation
- Nash equilibria and the price of anarchy for flows over time
- Planning for a bus-based evacuation
- Temporally repeated maximum dynamic flow with intermediate storage
- Network restructuring for dynamic flow improvement
- The quickest root-leaf interdiction problem on tree networks
- Improved algorithms for optimal k sink location on path networks
- Discrete evacuation in graphs with multiple exits
- Competitive routing over time
- Optimizing evacuation via budget constrained maximum dynamic flow with speed variation and intermediate storage
- An improved online evacuation strategy from a convex region on grid networks
- The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
- Pedestrian travel behavior modeling
- Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Approximating earliest arrival flows with flow-dependent transit times
- A column-generation approach for joint mobilization and evacuation planning
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776597)
