K-adaptability in stochastic optimization
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- Finite Adaptability in Multistage Linear Optimization
- Generalized light robustness and the trade-off between robustness and nominal quality
- Introduction to Stochastic Programming
- Light robustness
- Non deterministic polynomial optimization problems and their approximations
- On the power of robust solutions in two-stage stochastic and adaptive optimization problems
- Robust convex optimization
- Robust optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The concept of recoverable robustness, linear programming recovery, and railway applications
- \(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
Cited in
(11)- Structural adaptation via \(\mathbb L_p\)-norm oracle inequalities
- On the power of robust solutions in two-stage stochastic and adaptive optimization problems
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems
- \(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
- A framework for inherently interpretable optimization models
- A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem
- Two-stage flexible-choice problems under uncertainty
- A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization
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)
