10 citations · 42 across the 47 of their papers we have counts for
4 papers · 1 filter
Combinatorial Optimization Problems with Balanced Regret
Marc Goerigk, Michael Hartisch
For decision making under uncertainty, min-max regret has been established as a popular methodology to find robust solutions. In this approach, we compare the performance of our so…
On the Recoverable Traveling Salesman Problem
Marc Goerigk, Stefan Lendl, Lasse Wulf
In this paper we consider the Recoverable Traveling Salesman Problem (TSP). Here the task is to find two tours simultaneously, such that the intersection between the tours is at le…
Investigating the Recoverable Robust Single Machine Scheduling Problem Under Interval Uncertainty
Matthew Bold, Marc Goerigk
We investigate the recoverable robust single machine scheduling problem under interval uncertainty. In this setting, jobs have first-stage processing times p and second-stage proce…
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty
Marc Goerigk, Stefan Lendl, Lasse Wulf
We consider two-stage robust optimization problems, which can be seen as games between a decision maker and an adversary. After the decision maker fixes part of the solution, the a…