The following pages link to (Q3128904):
Displaying 24 items.
- Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations (Q298898) (← links)
- A novel method for planning a staged evacuation (Q394385) (← links)
- Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
- Pattern-based evacuation planning for urban areas (Q421705) (← links)
- Earliest arrival flows in networks with multiple sinks (Q496688) (← links)
- Improved algorithms for the evacuation route planning problem (Q724759) (← links)
- Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm (Q828853) (← links)
- Approximating earliest arrival flows with flow-dependent transit times (Q867858) (← links)
- Optimal building evacuation time considering evacuation routes (Q1011205) (← links)
- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs (Q1273088) (← links)
- Efficient continuous-time dynamic network flow algorithms (Q1306377) (← links)
- Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
- Optimal egress time calculation and path generation for large evacuation networks (Q1945097) (← links)
- A heuristic algorithm for the earliest arrival flow with multiple sources (Q2016467) (← links)
- Network flow with intermediate storage: models and algorithms (Q2226495) (← links)
- Facility location for large-scale emergencies (Q2430604) (← links)
- A survey on models and algorithms for discrete evacuation planning network problems (Q2514655) (← links)
- A Stackelberg strategy for routing flow over time (Q2516242) (← links)
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs (Q2664011) (← links)
- Universally maximum flow with piecewise-constant capacities (Q2764994) (← links)
- An Introduction to Network Flows over Time (Q2971621) (← links)
- Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems (Q5136261) (← links)
- Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network (Q5191132) (← links)
- FlowLoc problems with maximum excess flow (Q6059592) (← links)
