scientific article
From MaRDI portal
Publication:2776597
zbMath1048.90041MaRDI QIDQ2776597
Stevanus A. Tjandra, Horst W. Hamacher
Publication date: 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (61)
Solving the absolute 1-center problem in the quickest path case ⋮ Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) ⋮ Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm ⋮ Efficient contraflow algorithms for quickest evacuation planning ⋮ Scheduling evacuation operations ⋮ DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS ⋮ Modeling and optimizing traffic light settings in road networks ⋮ Routing and scheduling on evacuation path networks using centralized hybrid approach ⋮ Solving the bus evacuation problem and its variants ⋮ 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 ⋮ 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 ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Efficient continuous contraflow algorithms for evacuation planning problems ⋮ Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning ⋮ Modeling emergency response operations: a theory building survey ⋮ The energy-constrained quickest path problem ⋮ Fibonacci helps to evacuate from a convex region in a grid network ⋮ A capacitated network flow optimization approach for short notice evacuation planning ⋮ Ranking robustness and its application to evacuation planning ⋮ A novel method for planning a staged evacuation ⋮ A column-generation approach for joint mobilization and evacuation planning ⋮ Lexicographically optimal earliest arrival flows ⋮ Large‐scale zone‐based evacuation planning—Part I: Models and algorithms ⋮ Improved algorithms for computing minmax regret sinks on dynamic path and tree networks ⋮ Emergency evacuation of hazardous chemical accidents based on diffusion simulation ⋮ Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study ⋮ Pattern-based evacuation planning for urban areas ⋮ Optimal egress time calculation and path generation for large evacuation networks ⋮ The building evacuation problem with shared information ⋮ A stochastic programming approach for Shelter location and evacuation planning ⋮ A Pilgrim Scheduling Approach to Increase Safety During the Hajj ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ Planning for a bus-based evacuation ⋮ Unnamed Item ⋮ Integrated optimal scheduling of repair crew and relief vehicle after disaster ⋮ Decision support for hospital evacuation and emergency response ⋮ A robust bus evacuation model with delayed scenario information ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ Simultaneous evacuation and entrance planning in complex building based on dynamic network flows ⋮ 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 ⋮ An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Competitive routing over time ⋮ Unnamed Item ⋮ An improved online evacuation strategy from a convex region on grid networks ⋮ Minsum \(k\)-sink problem on path networks ⋮ Partial contraflow with path reversals for evacuation planning ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths ⋮ Optimal Evacuation Solutions for Large-Scale Scenarios ⋮ Distributed Evacuation in Graphs with Multiple Exits ⋮ An optimization model for the evacuation time in the presence of delay ⋮ Discrete Newton methods for the evacuation problem ⋮ Abstract network flow with intermediate storage for evacuation planning ⋮ Pedestrian travel behavior modeling
This page was built for publication:
