Dorothee Henke
- Combinatorial optimization
- Computational complexity theory
- Bilevel optimization
- Robust optimization
- Hub location problems
- Approximation algorithms
Working Papers
- M. Goerigk, D. Henke, and L. Wulf: The complexity landscape of two-stage robust selection problems with budgeted uncertainty. [preprint]
- S. Rodríguez-Ballesteros, J. Alcaraz, L. Anton-Sanchez, M. Goerigk, and D. Henke: A robust optimization approach for scheduling with uncertain start-time dependent costs.
- M. Goerigk, D. Henke, J. Kager, F. Schäfer, and C. Thielen: A fast approximate column-and-constraint generation method for two-stage robust mixed-integer programs. [preprint]
- C. Grüne, D. Henke, E. Rotenberg, and L. Wulf: The complexity of Stackelberg pricing games. [preprint]
- D. Henke, H. Lefebvre, M. Schmidt, and J. Thürauf: On coupling constraints in pessimistic linear bilevel optimization. [preprint]
- N. Pommerening, M. Hügging, D. Henke, C. Buchheim, and U. Clausen: An oracle-based appraoch for price-setting problems in logistics. [preprint]
2025
- D. Henke: The robust bilevel selection problem. Open Journal of Mathematical Optimization 6 (2025), 4. [paper] [preprint]
- D. Henke, H. Lefebvre, M. Schmidt, and J. Thürauf: On coupling constraints in linear bilevel optimization. Optimization Letters 19.3 (2025), pages 689–697. [paper] [preprint]
- D. Henke and L. Wulf: On the complexity of the bilevel shortest path problem. Networks 86.4 (2025), pages 428–445. [paper] [preprint]
2024
- M. Ahrens, D. Henke, S. Rabenstein, and J. Vygen: Faster goal-oriented shortest path search for bulk and incremental detailed routing. Mathematical Programming 206.1–2 (2024), pages 3–32. [paper] [preprint]
Extended abstract: Faster goal-oriented shortest path search for bulk and incremental detailed routing. Integer Programming and Combinatorial Optimization (IPCO) 2022, pages 15–28. [paper]
2023
- 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, pages 257–273. [paper] [preprint]
2022
- 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 (2022), pages 803–824. [paper] [preprint]
Extended abstract: The robust bilevel continuous knapsack problem. Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW) 2019, pages 17–20. - C. Buchheim, D. Henke, and F. Hommelsheim: On the complexity of the bilevel minimum spanning tree problem. Networks 80.3 (2022), pages 338–355. [paper] [preprint]
- 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 (2022), pages 521–542. [paper] [preprint]
2021
- C. Buchheim, D. Henke, and F. Hommelsheim: On the complexity of robust bilevel optimization with uncertain follower's objective. Operations Research Letters 49.5 (2021), pages 703–707. [paper] [preprint]
Sommersemester 2026
- Combinatorial Optimization (Übung)
- Doctoral Seminar in Optimization
Wintersemester 2025/26
- Supply Chain and Operations Management (Übung)
- Heuristics and Approximations Methods (Übung)
- Doctoral Seminar in Optimization
Sommersemester 2025
- Fundamentals of Management Science II (Übung)
- Doctoral Seminar in Optimization
Wintersemester 2024/25
- Heuristics and Approximations Methods (Übung)
- Network Optimization (Übung)
- Doctoral Seminar in Optimization
Sommersemester 2024
- Fundamentals of Management Science II (Übung)
- Masterseminar in Business Analytics
- Doctoral Seminar in Optimization
Wintersemester 2023/24
- Heuristics and Approximations Methods (Übung)
- Network Optimization (Übung)
- Doctoral Seminar in Optimization
- seit 2023 wissenschaftliche Mitarbeiterin, Universität Passau
- 2025 Dr. rer. nat. in Mathematik, Technische Universität Dortmund
- 2018 M. Sc. in Mathematik, Universität Bonn
- 2016 B. Sc. in Mathematik, Universität Bonn
Ich bin damit einverstanden, dass beim Abspielen des Videos eine Verbindung zum Server von Vimeo hergestellt wird und dabei personenbezogenen Daten (z.B. Ihre IP-Adresse) übermittelt werden.
Ich bin damit einverstanden, dass beim Abspielen des Videos eine Verbindung zum Server von YouTube hergestellt wird und dabei personenbezogenen Daten (z.B. Ihre IP-Adresse) übermittelt werden.
Video anzeigen
