10 citations · 42 across the 47 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.OC2026
The complexity landscape of robust (integer) linear programming
Michael Poss, Jannis Kurtz, Marc Goerigk +1
We study the computational complexity of the decision versions of three classic robust optimization problems: static robust optimization, two-stage (adjustable) robust optimization…
math.OC2026
The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
Marc Goerigk, Dorothee Henke, Lasse Wulf
A standard type of uncertainty set in robust optimization is budgeted uncertainty, where an interval of possible values for each parameter is given and the total deviation from the…