Chassein, André B.; Goerigk, Marc - In: European Journal of Operational Research 244 (2015) 3, pp. 739-747
Minmax regret optimization aims at finding robust solutions that perform best in the worst-case, compared to the respective optimum objective value in each scenario. Even for simple uncertainty sets like boxes, most polynomially solvable optimization problems have strongly NP-complete minmax...