10 citations · 38 across the 10 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
A Robust Optimization Approach for Scheduling with Uncertain Start-Time Dependent Costs
Sofía Rodríguez-Ballesteros, Javier Alcaraz, Laura Anton-Sanchez +2
In this work, we study a single-machine scheduling problem that aims at minimizing the total cost of a schedule subject to start-time dependent costs. This framework naturally capt…