Chair of Discrete Optimization

Welcome to the webpage of the Chair of Discrete Optimization

Discrete optimization problems are ubiquitous. Finding an optimal way to route information through a network or determining an energy-efficient way to display an image are just two examples from everyday life. Our research focuses on the design and analysis of algorithms for discrete optimization problems. We contribute with theoretical results in this area as well as with the application of our research to real-word problems.

Members of our group are currently working in these sub-areas of the field:
 

Combinatorial Optimization

Applied Optimization

Integer Programming