Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions

DOI10.1016/j.endm.2016.03.007zbMath1354.90168OpenAlexW2396547373MaRDI QIDQ325382

Jannis Kurtz, Christoph Buchheim

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.007

zbMATH Keywords

complexitycombinatorial optimizationrobust optimization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items (7)

Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty ⋮ Min-Max-Min Optimization with Smooth and Strongly Convex Objectives ⋮ \(K\)-adaptability in two-stage mixed-integer robust optimization ⋮ Min max min robust (relative) regret combinatorial optimization ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ Min-max-min robust combinatorial optimization ⋮ Oracle-based algorithms for binary two-stage robust optimization

Cites Work

• Robust solutions of uncertain linear programs
• Geometric algorithms and combinatorial optimization.
• Second-order cone programming
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Light Robustness

This page was built for publication: Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions