The following pages link to (Q2776597):
Displaying 50 items.
- Scheduling evacuation operations (Q309072) (← links)
- Modeling and optimizing traffic light settings in road networks (Q337395) (← links)
- Evacuation modeling: a case study on linear and nonlinear network flow models (Q339928) (← links)
- Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
- Sink location to find optimal shelters in evacuation planning (Q339937) (← links)
- Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers (Q339938) (← links)
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning (Q367642) (← links)
- A novel method for planning a staged evacuation (Q394385) (← links)
- Pattern-based evacuation planning for urban areas (Q421705) (← links)
- Decision support for hospital evacuation and emergency response (Q478035) (← links)
- A robust bus evacuation model with delayed scenario information (Q480774) (← links)
- Nash equilibria and the price of anarchy for flows over time (Q647485) (← links)
- Planning for a bus-based evacuation (Q647528) (← links)
- Competitive routing over time (Q719282) (← links)
- An improved online evacuation strategy from a convex region on grid networks (Q724733) (← links)
- The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) (← links)
- Pedestrian travel behavior modeling (Q813042) (← links)
- Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm (Q828853) (← links)
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks (Q860399) (← links)
- Approximating earliest arrival flows with flow-dependent transit times (Q867858) (← links)
- A column-generation approach for joint mobilization and evacuation planning (Q890000) (← links)
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths (Q967437) (← links)
- Efficient contraflow algorithms for quickest evacuation planning (Q1623855) (← links)
- Routing and scheduling on evacuation path networks using centralized hybrid approach (Q1651573) (← links)
- Solving the bus evacuation problem and its variants (Q1651627) (← links)
- The energy-constrained quickest path problem (Q1676484) (← links)
- Ranking robustness and its application to evacuation planning (Q1681390) (← links)
- Emergency evacuation of hazardous chemical accidents based on diffusion simulation (Q1693787) (← links)
- Integrated optimal scheduling of repair crew and relief vehicle after disaster (Q1722985) (← links)
- Bi-objective safe and resilient urban evacuation planning (Q1749521) (← links)
- Dealing with residual energy when transmitting data in energy-constrained capacitated networks (Q1750473) (← links)
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks (Q1751923) (← links)
- A capacitated network flow optimization approach for short notice evacuation planning (Q1927009) (← links)
- Optimal egress time calculation and path generation for large evacuation networks (Q1945097) (← links)
- Simultaneous evacuation and entrance planning in complex building based on dynamic network flows (Q1984976) (← links)
- A heuristic algorithm for the earliest arrival flow with multiple sources (Q2016467) (← links)
- An optimization model for the evacuation time in the presence of delay (Q2072569) (← links)
- Abstract network flow with intermediate storage for evacuation planning (Q2103018) (← links)
- Solving the absolute 1-center problem in the quickest path case (Q2119314) (← links)
- Modeling emergency response operations: a theory building survey (Q2177817) (← links)
- Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study (Q2196117) (← links)
- Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
- Partial contraflow with path reversals for evacuation planning (Q2288951) (← links)
- Discrete Newton methods for the evacuation problem (Q2330131) (← links)
- Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) (Q2362245) (← links)
- Continuous dynamic contraflow approach for evacuation planning (Q2399339) (← links)
- Efficient continuous contraflow algorithms for evacuation planning problems (Q2400022) (← links)
- Fibonacci helps to evacuate from a convex region in a grid network (Q2410092) (← links)
- Algorithms for time-dependent bicriteria shortest path problems (Q2465939) (← links)
