\(K\)-adaptability in stochastic optimization

DOI10.1007/s10107-021-01767-3zbMath1506.90180OpenAlexW4210340940MaRDI QIDQ2097652

Michele Monaci, Enrico Malaguti, Jonas Pruente

Publication date: 14 November 2022

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

Full work available at URL: https://doi.org/10.1007/s10107-021-01767-3

zbMATH Keywords

stochastic programmingcomputational experimentsbranch-and-priceexact algorithms\(K\)-adaptability

Mathematics Subject Classification ID

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

Related Items (2)

A framework for inherently interpretable optimization models ⋮ Special issue: Global solution of integer, stochastic and nonconvex optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized light robustness and the trade-off between robustness and nominal quality
• Non deterministic polynomial optimization problems and their approximations
• \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
• \(K\)-adaptability in two-stage mixed-integer robust optimization
• Robust Convex Optimization
• On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
• K-Adaptability in Two-Stage Robust Binary Programming
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Light Robustness
• Introduction to Stochastic Programming
• 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: \(K\)-adaptability in stochastic optimization