Chair for Software and Algorithms for discrete Optimization

In this area of expertise, we investigate intelligent algorithms for the solution of discrete optimization problems with particular emphasis on practical implementation.

We research network algorithms (e.g., SP, MCF, TSP, STP) and methods for general (integer) optimization problems (e.g., LP, ILP, MILP, MINLP).

Also, we are engaged in modeling and research of solution methods for real-world industrial problems, such as the control and planning of gas, water and telecommunication networks, energy system models, and everything else that seems relevant and exciting to us. How well the methods can be implemented in practice is always important to us, be it on supercomputers (HPSC), graphics cards (GPU), workstations, or systems-on-chips (SoC).