Min-max-min robust combinatorial optimization

DOI10.1007/s10107-016-1053-zzbMath1365.90224OpenAlexW2473069854MaRDI QIDQ526823

Christoph Buchheim, Jannis Kurtz

Publication date: 15 May 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-016-1053-z

zbMATH Keywords

complexityrobust optimization\(k\)-adaptability

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (22)

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty ⋮ Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty ⋮ A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set ⋮ Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems ⋮ On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty ⋮ Min-Max-Min Optimization with Smooth and Strongly Convex Objectives ⋮ Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions ⋮ Robust recoverable 0-1 optimization problems under polyhedral uncertainty ⋮ \(K\)-adaptability in two-stage mixed-integer robust optimization ⋮ Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty ⋮ A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem ⋮ A framework for inherently interpretable optimization models ⋮ On the complexity of robust multi-stage problems with discrete recourse ⋮ An oracle-based framework for robust combinatorial optimization ⋮ Min max min robust (relative) regret combinatorial optimization ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty ⋮ Generating hard instances for robust combinatorial optimization ⋮ Oracle-based algorithms for binary two-stage robust optimization ⋮ Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications ⋮ Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty ⋮ A Lagrangian dual method for two-stage robust optimization with binary uncertainties

Cites Work

• Unnamed Item
• Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
• Robust linear optimization under general norms.
• Infinitely constrained optimization problems
• Geometric algorithms and combinatorial optimization.
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• Robust Convex Optimization
• Recoverable robust shortest path problems
• Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
• K-Adaptability in Two-Stage Robust Binary Programming
• Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Finite Adaptability in Multistage Linear Optimization
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Min-max-min robust combinatorial optimization