Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
From MaRDI portal
Publication:5106418
DOI10.1287/ijoc.2021.1156OpenAlexW4206873937MaRDI QIDQ5106418
Ayşe N. Arslan, Marco Silva, Michael Poss
Publication date: 19 September 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1156
Related Items
Min-Max-Min Optimization with Smooth and Strongly Convex Objectives, A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem
Uses Software
Cites Work
- Min-max-min robust combinatorial optimization
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust discrete optimization and network flows
- A scalable exact algorithm for the vertex \(p\)-center problem
- Robust combinatorial optimization with knapsack uncertainty
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
- Binary decision rules for multistage adaptive mixed-integer optimization
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- On the complexity and approximation of the maximum expected value all-or-nothing subset
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Recent advances in robust optimization: an overview
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
- A Dynamic Programming Approach for a Class of Robust Optimization Problems
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
- Julia: A Fresh Approach to Numerical Computing
- Theory and Applications of Robust Optimization
- Robust Network Design with Uncertain Outsourcing Cost
- K-Adaptability in Two-Stage Robust Binary Programming
- The m-Center Problem
- JuMP: A Modeling Language for Mathematical Optimization
