Publication:339930

DOI10.1007/S13675-016-0067-XzbMATH Open1349.90181OpenAlexW2269360343MaRDI QIDQ339930FDOQ339930

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

network flowrobust optimizationnetwork designadjustable 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

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

Cited In (1)

• Sink Evacuation on Trees with Dynamic Confluent Flows

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339930)