Dorothee Henke

19 papers B 1Journal 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty.
CoRR
Marc Goerigk, Dorothee Henke, Lasse Wulf
2025 J jnl
On coupling constraints in linear bilevel optimization.
Optim. Lett.
Dorothee Henke, Henri Lefebvre, Martin Schmidt, Johannes Thürauf
2025 J jnl
On the Complexity of the Bilevel Shortest Path Problem.
Networks
Dorothee Henke, Lasse Wulf
2025 J jnl
The Complexity of Stackelberg Pricing Games.
CoRR
Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf
2025 J jnl
The Robust Bilevel Selection Problem.
Open J. Math. Optim.
Dorothee Henke
2024 J jnl
Faster goal-oriented shortest path search for bulk and incremental detailed routing.
Math. Program.
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
2024 J jnl
On the Complexity of the Bilevel Shortest Path Problem.
CoRR
Dorothee Henke, Lasse Wulf
2024 J jnl
The Robust Bilevel Selection Problem.
CoRR
Dorothee Henke
2022 B conf
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing.
IPCO
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
2022 J jnl
On the complexity of the bilevel minimum spanning tree problem.
Networks
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
2022 J jnl
Optimization at the Second Level (Dagstuhl Seminar 22441).
Dagstuhl Reports
Luce Brotcorne, Christoph Buchheim, Dick den Hertog, Dorothee Henke
2022 J jnl
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective.
J. Optim. Theory Appl.
Christoph Buchheim, Dorothee Henke, Jannik Irmai
2022 J jnl
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective.
J. Glob. Optim.
Christoph Buchheim, Dorothee Henke
2021 J jnl
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing.
CoRR
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
2021 J jnl
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective.
CoRR
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
2021 J jnl
On the complexity of robust bilevel optimization with uncertain follower's objective.
Oper. Res. Lett.
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
2021 J jnl
The stochastic bilevel continuous knapsack problem with uncertain follower's objective.
CoRR
Christoph Buchheim, Dorothee Henke, Jannik Irmai
2020 J jnl
On the Complexity of the Bilevel Minimum Spanning Tree Problem.
CoRR
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
2019 J jnl
The robust bilevel continuous knapsack problem.
CoRR
Christoph Buchheim, Dorothee Henke