Hauptinhalt
M.Sc. Dorothee Henke
Kontakt
Technische Universität
Dortmund
Fakultät für Mathematik
Vogelpothsweg 87
44227 Dortmund
Germany
E-Mail:
Dorothee Henke
Telefon: (0231) 755-7226
Raum: M/520
Sprechstunde
- nach Vereinbarung (E-Mail genügt)
Interessengebiete
- Combinatorial Optimization
- Robust Optimization
- Bilevel Optimization
- Approximation Algorithms
Projekte
Veröffentlichungen
- N. Jost, D. Henke, I. Hedtke, O. Bredtmann, J. Weise, C. Buchheim, and U. Clausen:
Partitioned vs. Integrated Planning of Hinterland Networks for LCL Transportation
Advances in Resilient and Sustainable Transport – Proceedings of the 6th Interdisciplinary Conference on Production, Logistics and Traffic (ICPLT 2023), 257–273 (2023)
[arXiv]
- C. Buchheim, D. Henke, and F. Hommelsheim:
On the complexity of the bilevel minimum spanning tree problem
Networks 80(3), 338–355 (2022)
[arXiv]
- M. Ahrens, D. Henke, S. Rabenstein, and J. Vygen:
Faster goal-oriented shortest path search for bulk and incremental detailed routing
[arXiv]
Extended abstract: Faster goal-oriented shortest path search for bulk and incremental detailed routing
Integer Programming and Combinatorial Optimization (IPCO) 2022, 15–28
- C. Buchheim, D. Henke, and J. Irmai:
The stochastic bilevel continuous knapsack problem with uncertain follower's objective
Journal of Optimization Theory and Applications 194(2), 521–542 (2022)
[arXiv]
- C. Buchheim and D. Henke:
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
Journal of Global Optimization 83(4), 803–824 (2022)
[arXiv]
Extended abstract: The robust bilevel continuous knapsack problem
Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019), 17–20 (2019)
- C. Buchheim, D. Henke, and F. Hommelsheim:
On the complexity of robust bilevel optimization with uncertain follower's objective
Operations Research Letters 49(5), 703–707 (2021)
[arXiv]
