Robust flows with losses and improvability in evacuation planning

DOI10.1007/s13675-016-0067-xzbMath1349.90181OpenAlexW2269360343MaRDI QIDQ339930

Marc Goerigk, Ismaila Abderhamane Ndiaye

Publication date: 11 November 2016

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/79193/1/paper_bw.pdf

zbMATH Keywords

robust optimizationnetwork designnetwork flowadjustable robustnessflow with lossesrandom recourse

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The robust vehicle routing problem with time windows
• Robust location transportation problems under uncertain demands
• Optimizing cost flows by edge cost and capacity upgrade
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Modeling of building evacuation problems by network flows with side constraints
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope
• OR/MS research in disaster operations management
• 2-stage robust MILP with continuous recourse variables
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Rollout algorithms for combinatorial optimization
• On budget-constrained flow improvement.
• Combinatorial Approximation Algorithms for Generalized Flow Problems
• Faster Algorithms for the Generalized Network Flow Problem
• Best Upgrade Plans for Large Road Networks
• A Scenario-Based Approach for Robust Linear Optimization
• Upgrading Shortest Paths in Networks
• Recoverable Robust Knapsacks: Γ-Scenarios
• The Safest Escape problem
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• A network flow approach to a city emergency evacuation planning
• Robust capacity expansion of network flows
• Upgrading arcs to minimize the maximum travel time in a network

This page was built for publication: Robust flows with losses and improvability in evacuation planning