Dorothee Henke

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 13

Top Topics

Knapsack Problem

Top Venues

Oper. Res. Lett.

J. Optim. Theory Appl.

Publications

Dorothee Henke
The Robust Bilevel Selection Problem. CoRR (2024)
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
Faster goal-oriented shortest path search for bulk and incremental detailed routing. Math. Program. 206 (1) (2024)
Christoph Buchheim, Dorothee Henke, Jannik Irmai
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective. J. Optim. Theory Appl. 194 (2) (2022)
Luce Brotcorne, Christoph Buchheim, Dick den Hertog, Dorothee Henke
Optimization at the Second Level (Dagstuhl Seminar 22441). Dagstuhl Reports 12 (10) (2022)
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. IPCO (2022)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the complexity of the bilevel minimum spanning tree problem. Networks 80 (3) (2022)
Christoph Buchheim, Dorothee Henke
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective. J. Glob. Optim. 83 (4) (2022)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective. CoRR (2021)
Christoph Buchheim, Dorothee Henke, Jannik Irmai
The stochastic bilevel continuous knapsack problem with uncertain follower's objective. CoRR (2021)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the complexity of robust bilevel optimization with uncertain follower's objective. Oper. Res. Lett. 49 (5) (2021)
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. CoRR (2021)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the Complexity of the Bilevel Minimum Spanning Tree Problem. CoRR (2020)
Christoph Buchheim, Dorothee Henke
The robust bilevel continuous knapsack problem. CoRR (2019)