On robust maximum flow with polyhedral uncertainty sets

DOI10.1007/s11590-009-0116-yzbMath1169.90325OpenAlexW2081956611MaRDI QIDQ839800

Michel Minoux

Publication date: 3 September 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0116-y

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Combinatorial optimization (90C27)

Related Items (11)

Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems ⋮ Robust combinatorial optimization with knapsack uncertainty ⋮ On 2-stage robust LP with RHS uncertainty: complexity results and applications ⋮ Cooperative maximum-flow problem under uncertainty in logistic networks ⋮ The maximum flow problem of uncertain network ⋮ Robust multiobjective optimization with application to Internet routing ⋮ Bilevel model for adaptive network flow problem ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard ⋮ Recent advances in robust optimization: an overview ⋮ Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard

Cites Work

• On 2-stage robust LP with RHS uncertainty: complexity results and applications
• Robust discrete optimization and network flows
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• The Price of Robustness
• Algorithms and Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On robust maximum flow with polyhedral uncertainty sets