$K$-adaptability in two-stage distributionally robust binary programming
type: Item
instance of: scholarly article
title: $K$-adaptability in two-stage distributionally robust binary programming
zbMATH Open document ID: 1408.90210
author: Grani A. Hanasusanto
author: Daniel Kuhn
author: Wolfram Wiesemann
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6945429
zbMATH Keywords: distributionally robust optimization
zbMATH Keywords: integer programming
zbMATH Keywords: two-stage problems
describes a project that uses: Gurobi
describes a project that uses: YALMIP
MaRDI profile type: Publication
full work available at URL: j.orl.2015.10.006
OpenAlex ID: W2151537611
cites work: Tractable stochastic analysis in high dimensions via robust optimization
cites work: AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
cites work: Finite Adaptability in Multistage Linear Optimization
cites work: A Definition of Uncertainty Aversion
cites work: Maxmin expected utility with non-unique prior
cites work: K-Adaptability in Two-Stage Robust Binary Programming
cites work: Distributionally robust mixed integer linear programs: persistency models with applications
cites work: On duality theory of conic linear problems.
cites work: Distributionally Robust Convex Optimization
DOI: 10.1016/J.ORL.2015.10.006
description: scientific article; zbMATH DE number 6945429