K-adaptability in stochastic optimization

DOI10.1007/S10107-021-01767-3zbMATH Open1506.90180OpenAlexW4210340940MaRDI QIDQ2097652FDOQ2097652

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

Recommendations

• \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
• \(K\)-adaptability in two-stage mixed-integer robust optimization
• \(K\)-adaptability in two-stage robust binary programming
• $K$-adaptability in two-stage distributionally robust binary programming
• Min-max-min robust combinatorial optimization

zbMATH Keywords

computational experimentsexact algorithmsstochastic programmingbranch-and-price\(K\)-adaptability

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Price of Robustness
• Title not available (Why is that?)
• Light robustness
• Introduction to Stochastic Programming
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Robust convex optimization
• Generalized light robustness and the trade-off between robustness and nominal quality
• Title not available (Why is that?)
• The concept of recoverable robustness, linear programming recovery, and railway applications
• Non deterministic polynomial optimization problems and their approximations
• Finite Adaptability in Multistage Linear Optimization
• On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
• K-Adaptability in Two-Stage Robust Binary Programming
• \(K\)-adaptability in two-stage mixed-integer robust optimization
• \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty

Cited In (4)

• Structural adaptation via \(\mathbb L_p\)-norm oracle inequalities
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems
• \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
• A framework for inherently interpretable optimization models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097652)