A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem
From MaRDI portal
Publication:6164623
DOI10.1016/j.cor.2023.106243arXiv2209.02936MaRDI QIDQ6164623
Alireza Ghasemi, Ahmed Saif, Alireza Ghahtarani, Erick Delage
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.02936
combinatorial optimizationlogic-based Benders decompositionadaptive robust optimization\(K\)-adaptability problemdiscrete recourse
Related Items (1)
Cites Work
- Generalized decision rule approximations for stochastic programming via liftings
- Min-max-min robust combinatorial optimization
- Primal and dual linear decision rules in stochastic and robust optimization
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Adjustable robust solutions of uncertain linear programs
- Binary decision rules for multistage adaptive mixed-integer optimization
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- Theory and Applications of Robust Optimization
- Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
- K-Adaptability in Two-Stage Robust Binary Programming
- Finite Adaptability in Multistage Linear Optimization
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
- Supermodularity and Affine Policies in Dynamic Robust Optimization
This page was built for publication: A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem
