Approximation Algorithms for Min-max-min Robust Optimization and K-Adaptability under Objective Uncertainty

In this work we investigate the min-max-min robust optimization problem and the k-adaptability robust optimization problem for binary problems with uncertain costs. The idea of the first approach is to calculate a set of k feasible solutions which are worst-case optimal if in each possible scenario the best of the k solutions is implemented. It … Read more