The main focus of the group is on research and teaching in the areas of Discrete Algorithms and Combinatorial Optimization.
In our research projects, we develop efficient algorithms for various discrete optimization problems and study their computational complexity. We are particularly interested in network flow problems, notably flows over time and unsplittable flows, as well as different scheduling models, including stochastic and online scheduling. Variants of these problems involving several independent agents are studied from the perspective of algorithmic game theory. We also work on applications in traffic, transport, and logistics in interdisciplinary cooperations with other researchers as well as partners from industry.
From a methodological perspective, we are interested in efficient approximation algorithms with provable performance guarantees, in the analysis of linear and higher order relaxations, as well as in aspects of robustness and sensitivity of solutions to mathematical optimization problems. We also contribute to a rigorous mathematical analysis and explanation of methods from Artificial Intelligence, such as neural networks and other meta-heuristics.
Efficient Minimization of Parametric Submodular Functions for Quickest Transshipments ・ Stochastic Scheduling with Restricted Adaptivity ・ Combinatorial Structures and Algorithms in Symmetric Graphs ・ All projects
Prof. Dr. Martin Skutella ・ Dr. Guillaume Sagnol ・ Priv.-Doz. Dr. Frank Lutz ・ Dorothea Kiefer-Hoeft ・ Ralf Hoffmann ・ Ekin Ergen ・ Mohammed Majthoub Almoghrabi ・ Arturo Merino ・ Sarah Morell ・ Ihab Sabik ・ Daniel Schmidt genannt Waldschmidt ・ Frieder Smolny ・ Khai Van Tran ・ Theresa Ziemke
Technische Universität Berlin
Sekr. MA 5-2
Straße des 17. Juni 136
|Office (Sekr.)||MA 523|
|Tel. (Sekr.)||+49 30 314-28641|
|Fax (Sekr.)||+49 30 314-21117|