Discrete Optimization Lab

Prof. Dr. Johannes Thürauf

At the Discrete Optimization Lab, we develop algorithms and solution techniques to solve optimization problems in different fields.

  • Optimization under Uncertainty
    We develop solution methods that take into account uncertainties, e.g. uncertain data, in optimization problems. Our goal is to compute robust, reliable, resilient or adaptive solutions that can be applied across various fields, from resilient energy networks to logistics.
  • Bilevel Optimization
    We further focus on solving bilevel and multilevel optimization problems that are capable of modeling hierarchical decision processes. These problems are particularly relevant in many applications including machine learning tasks.
  • Optimization and Beyond
    Moreover, we conduct research in nonlinear, and integer programming, network optimization, graph algorithms, and polyhedral combinatorics.
  • Link Theory and Practice
    We are dedicated to link theory and practice by developing advanced solution meth- ods, implementing them, and applying these methods to real-world challenges. Our research emphasizes interdisciplinary collaborations and combines expert knowledge from different fields, enabling us to jointly solve complex problems of today.

Prof. Dr. Johannes Thürauf
Professor of Discrete Optimization

News

October 22, 2025Our paper about BOBILib: Bilevel Optimization (Benchmark) Instance Library (jointly with Thomas Kleinert, Ivana LjubicTed Ralphs and Martin Schmidt) has been accepted for publication in Mathematical Programming Computation. The latest preprint version can be found at Optimization Online and the website of the library including all instances and solutions is https://bobilib.org.
September 25, 2025I gave a talk on Bilevel and Robust Optimization with Nonlinear Flows at the International Workshop on Algorithmic Optimization in Trier.
September 22, 2025Today, our paper Learning the Follower’s Objective Function in Sequential Bilevel Games jointly with Ioana Molan and Martin Schmidt has been accepted for publication in Mathematical Methods of Operations Research. The corresponding preprint is available at Optimization Online.
September 18, 2025I had the opportunity to present our work On a Computationally Ill-Behaved Bilevel Problem with a Continuous and Nonconvex Lower Level at the International Workshop on Explainability and Interpretability in Optimization in Nuremberg, Germany.
September 3, 2025I have presented a talk on Robust Bilevel Optimization with Wait-and-See Follower: A Column-and-Constraint Generation Approach at the International Conference on Operations Research 2025, Bielefeld, Germany.
July 14, 2025Optimization meets Data Systems: Our interdisciplinary work, Instance-Optimized String Fingerprints (jointly with Mihail Stoian, Andreas Zimmerer, Alexander van Renen, and Andreas Kipf), has been accepted for presentation at the Applied AI for Database Systems and Applications (AIDB) workshop, taking place on September 1, 2025 in London, as part of the 51st International Conference on Very Large Data Bases (VLDB 2025). The preprint is available on arXiv.
July 7, 2025We released a major update to BOBILib: Bilevel Optimization (Benchmark) Instance Library, including separate benchmark sets for interdiction, mixed-integer, and pure-integer bilevel problems. The updated preprint is available on Optimization Online and all instances and solutions are available at bobilib.org.
July 1, 2025Today, I gave an invited talk at the MIP Europe Workshop 2025 in Clermont-Ferrand, France. The slides can be found here: slides.
March 14, 2025I am very grateful to have received the 2024 Meritorious Service Awards by Operations Research. Let’s continue supporting the scientific community by providing constructive reviews.
March 7, 2025Our new preprint On Coupling Constraints in Pessimistic Linear Bilevel Optimization (jointly with Dorothee Henke, Henri Lefebvre, and Martin Schmidt) is now available at Optimization Online, arXiv.

You still have questions?

Then contact our  Discrete Optimization Lab.

 discrete-optimization@utn.de