1 citations · 3 across the 12 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021★ 1 cited
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…
cs.DS2021
Assistance and Interdiction Problems on Interval Graphs
Hung P. Hoang, Stefan Lendl, Lasse Wulf
We introduce a novel framework of graph modifications specific to interval graphs. We study interdiction problems with respect to these graph modifications. Given a list of origina…
math.OC2021
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…