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.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…
math.OC2021
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
We investigate the complexity of bilevel combinatorial optimization with uncertainty in the follower's objective, in a robust optimization approach. We show that the robust counter…