Approximation guarantees for min-max-min robust optimization and k-adaptability under objective uncertainty

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

Robust optimization
The Price of Robustness
Robust solutions of uncertain linear programs
Robust discrete optimization and network flows
Introduction to stochastic programming.
Light robustness
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Robust convex optimization
Distributionally robust optimization and its tractable approximations
Adjustable robust solutions of uncertain linear programs
The concept of recoverable robustness, linear programming recovery, and railway applications
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
Min max min robust (relative) regret combinatorial optimization
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
Min-max-min robust combinatorial optimization
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Finite Adaptability in Multistage Linear Optimization
A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization
K-Adaptability in Two-Stage Robust Binary Programming
A Lagrangian dual method for two-stage robust optimization with binary uncertainties
\(K\)-adaptability in two-stage mixed-integer robust optimization
Bulk-robust combinatorial optimization
Distributionally Robust Convex Optimization
Robust combinatorial optimization under convex and discrete cost uncertainty
Piecewise static policies for two-stage adjustable robust linear optimization
Oracle-based algorithms for binary two-stage robust optimization
A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set
A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem
Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective
On Finite Adaptability in Two-Stage Distributionally Robust Optimization

This page was built for publication: Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty

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