10 citations · 38 across the 10 of their papers we have counts for
11 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…
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…
On Coupling Constraints in Linear Bilevel Optimization
Dorothee Henke, Henri Lefebvre, Martin Schmidt +1
It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there…
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…
Partitioned vs. Integrated Planning of Hinterland Networks for LCL Transportation
Niklas Jost, Dorothee Henke, Ivo Hedtke +4
Utilizing existing transportation networks better and designing (parts of) networks involves routing decisions to minimize transportation costs and maximize consolidation effects.…
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
Markus Ahrens, Dorothee Henke, Stefan Rabenstein +1
We develop new algorithmic techniques for VLSI detailed routing. First, we improve the goal-oriented version of Dijkstra's algorithm to find shortest paths in huge incomplete grid…
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective
Christoph Buchheim, Dorothee Henke, Jannik Irmai
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. T…
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…
On the Complexity of the Bilevel Minimum Spanning Tree Problem
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
We consider the bilevel minimum spanning tree (BMST) problem where the leader and the follower choose a spanning tree together, according to different objective functions. By showi…
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
Christoph Buchheim, Dorothee Henke
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack and the follower chooses an optimal packing according to his own profits, w…