Note—Some Equivalent Objectives for Dynamic Network Flow Problems
From MaRDI portal
Cited in
(22)- Modeling of building evacuation problems by network flows with side constraints
- A heuristic algorithm for the earliest arrival flow with multiple sources
- Algorithms for flows over time with scheduling costs
- 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
- A survey on models and algorithms for discrete evacuation planning network problems
- Dynamic resource allocation problem for transportation network evacuation
- An introduction to network flows over time
- Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations
- Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure
- Elementary modelling and behavioural analysis for emergency evacuations using social media
- Traffic Networks and Flows over Time
- The quickest flow problem
- Pattern-based evacuation planning for urban areas
- Decision support for hospital evacuation and emergency response
- Dynamic Atomic Congestion Games with Seasonal Flows
- A critical survey on the network optimization algorithms for evacuation planning problems
- Algorithms for Flows over Time with Scheduling Costs
- Optimal evacuation solutions for large-scale scenarios
- Nash equilibria and the price of anarchy for flows over time
- The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
- A survey of dynamic network flows
This page was built for publication: Note—Some Equivalent Objectives for Dynamic Network Flow Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947427)
