Showing math.OCShow all
3 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.OC2025
The robust selection problem with information discovery
Xiaoyu Chen, Marc Goerigk, Michael Poss
We explore a multiple-stage variant of the min-max robust selection problem with budgeted uncertainty that includes queries. First, one queries a subset of items and gets the exact…
math.OC2018
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 solutions. This approach is appropriate…