2 papers
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…