\(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
type: Item
instance of: scholarly article
title: \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
zbMATH Open document ID: 1430.90439
author: Christoph Buchheim
author: Jonas Pruente
published in: European Journal of Operational Research
publication date: 2019-04-30T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 7049424
zbMATH Keywords: stochastic programming
zbMATH Keywords: \(K\)-adaptability
zbMATH Keywords: integer programming
zbMATH Keywords: approximation
zbMATH Keywords: parameterized complexity
describes a project that uses: CPLEX
describes a project that uses: KAdaptabilitySolver
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.03.045
OpenAlex ID: W2934941469
cites work: Q3182207
cites work: Finite Adaptability in Multistage Linear Optimization
cites work: The Price of Robustness
cites work: Introduction to Stochastic Programming
cites work: Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
cites work: Min-max-min robust combinatorial optimization
cites work: Quadratic Combinatorial Optimization Using Separable Underestimators
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Some simplified NP-complete graph problems
cites work: K-Adaptability in Two-Stage Robust Binary Programming
cites work: $K$-adaptability in two-stage distributionally robust binary programming
cites work: Some optimal inapproximability results
DOI: 10.1016/J.EJOR.2019.03.045
Recommended article: \(K\)-adaptability in stochastic optimization
Recommended article: Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
Recommended article: Adaptive stability in combinatorial optimization problems
Recommended article: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
Recommended article: \(K\)-adaptability in two-stage mixed-integer robust optimization
Recommended article: Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
Recommended article: Adaptive Stochastic Optimization Techniques with Applications
Recommended article: Adaptive search with stochastic acceptance probabilities for global optimization
Recommended article: $K$-adaptability in two-stage distributionally robust binary programming
Recommended article: Adaptation of stochastic search methods realized on a homogeneous computational array under uncertainty
description: scientific article; zbMATH DE number 7049424