Faster Algorithms for Min-max-min Robustness for Combinatorial Problems with Budgeted Uncertainty

André Chassein, Marc Goerigk, Jannis Kurtz +1

We consider robust combinatorial optimization problems where the decision maker can react to a scenario by choosing from a finite set of $k$ solutions. This approach is appropriate…