4 papers
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…
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…
The Robust Bilevel Selection Problem
Dorothee Henke
In bilevel optimization problems, a leader and a follower make their decisions in a hierarchy, and both decisions may influence each other. Usually one assumes that both players ha…
On the Complexity of the Bilevel Shortest Path Problem
Dorothee Henke, Lasse Wulf
We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our pr…