\(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty

DOI10.1016/j.ejor.2019.03.045zbMath1430.90439OpenAlexW2934941469MaRDI QIDQ1740549

Jonas Pruente, Christoph Buchheim

Publication date: 30 April 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.03.045

zbMATH Keywords

stochastic programminginteger programmingapproximationparameterized complexity\(K\)-adaptability

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (3)

A framework for inherently interpretable optimization models ⋮ Oracle-based algorithms for binary two-stage robust optimization ⋮ \(K\)-adaptability in stochastic optimization

Uses Software

• CPLEX
• KAdaptabilitySolver

Cites Work

• Unnamed Item
• Min-max-min robust combinatorial optimization
• Some simplified NP-complete graph problems
• Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
• $K$-adaptability in two-stage distributionally robust binary programming
• K-Adaptability in Two-Stage Robust Binary Programming
• The Price of Robustness
• Introduction to Stochastic Programming
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Finite Adaptability in Multistage Linear Optimization
• Quadratic Combinatorial Optimization Using Separable Underestimators
• Some optimal inapproximability results

This page was built for publication: \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty