Abstract network flow with intermediate storage for evacuation planning
From MaRDI portal
Publication:2103018
Recommendations
Cites work
- scientific article; zbMATH DE number 1714716 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 5772889 (Why is no real title available?)
- scientific article; zbMATH DE number 871948 (Why is no real title available?)
- A Polynomial Algorithm for Weighted Abstract Flow
- A comprehensive survey on the quickest path problem
- A critical survey on the network optimization algorithms for evacuation planning problems
- A generalization of max flow—min cut
- A note on two problems in connexion with graphs
- A survey of dynamic network flows
- A survey on models and algorithms for discrete evacuation planning network problems
- Abstract flows over time: a first step towards solving dynamic packing problems
- Complexity analysis for maximum flow problems with arc reversals
- Continuous time dynamic contraflow models and algorithms
- Dynamics of disasters -- key concepts, models, algorithms, and insights. Selected papers based on the presentations at the 2nd international conference, Kalamata, Greece, June 29 -- July 2015, 2015
- Efficient continuous contraflow algorithms for evacuation planning problems
- Efficient continuous-time dynamic network flow algorithms
- Energy management for stationary electric energy storage systems: a systematic literature review
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Maximal Flow Through a Network
- Maximal, Lexicographic, and Dynamic Network Flows
- Modeling of building evacuation problems by network flows with side constraints
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- Network flow with intermediate storage: models and algorithms
- OR/MS research in disaster operations management
- Optimising shelter location and evacuation routing operations: the critical issues
- Partial contraflow with path reversals for evacuation planning
- Relief distribution networks: a systematic review
- The building evacuation problem with shared information
- The quickest flow problem
Cited in
(16)- Decomposition of probability marginals for security games in abstract networks
- Maximum flow in hybrid network with intermediate storage
- Network restructuring for dynamic flow improvement
- A network flow approach to a city emergency evacuation planning
- Decomposition of probability marginals for security games in max-flow/min-cut systems
- Maximum dynamic FlowLoc with intermediate storage: a temporally repeated approach
- Abstract Temporally Repeated Flow with Intermediate Storage
- FlowLoc problems with maximum excess flow
- On the quickest evacuation location problem in humanitarian operations: multi-objective modelling and matheuristic solution
- Optimizing evacuation via budget constrained maximum dynamic flow with speed variation and intermediate storage
- Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
- In memoriam: Urmila Pyakurel (1980--2023)
- A joint demand and supply management approach to large scale urban evacuation planning: evacuate or shelter-in-place, staging and dynamic resource allocation
- Efficient algorithms for abstract flow with partial switching
- Temporally repeated maximum dynamic flow with intermediate storage
- Generalized maximum flow over time with intermediate storage
This page was built for publication: Abstract network flow with intermediate storage for evacuation planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103018)
