• Combinatorial Optimization
• Computational Complexity Theory
• Bilevel Optimization
• Robust Optimization
• Hub Location Problems
• Approximation Algorithms

Publisches Papers 

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 TransportationAdvances in Resilient and Sustainable Transport – Proceedings of the 6th Interdisciplinary Conference on Production, Logistics and Traffic (ICPLT 2023), 257–273 (2023) [arXiv]

2022

• M. Ahrens, D. Henke, S. Rabenstein, and J. Vygen: Faster goal-oriented shortest path search for bulk and incremental detailed routingMathematical Programming (2023) [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 F. Hommelsheim: On the complexity of the bilevel minimum spanning tree problemNetworks 80(3), 338–355 (2022) [arXiv]
• C. Buchheim, D. Henke, and J. Irmai: The stochastic bilevel continuous knapsack problem with uncertain follower's objectiveJournal 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 objectiveJournal 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)

2021

• C. Buchheim, D. Henke, and F. Hommelsheim: On the complexity of robust bilevel optimization with uncertain follower's objectiveOperations Research Letters 49(5), 703–707 (2021) [arXiv]

Preprints

2024

• D. Henke, H. Lefebvre, M. Schmidt, J. Thürauf: On Coupling Constraints in Linear Bilevel Optimization" arXiv
• D. Henke: The Robust Bilevel Selection Problem arXiv

Sommersemester:

• Fundamentals of Management Science II (Übung)

• Bachelorseminar in Business Analytics
• Masterseminar in Business Analytics
• Doctoral Seminar in Optimization

Wintersemester:

• Network Optimization (Übung)
• Heuristics and Approximations Methods (Übung)

• Doctoral Seminar in Optimization