Discrete Optimization is concerned with the analysis and solution of problems, which are modelled as the minimization or maximization of functions over countable domains. The domains are restricted by constraints, which define the set of feasible solutions to the problem.

Our group is working in the following fields of research:

- Integer Programming
- Combinatorial Optimization
- Graph Theory
- Algorithmic Geometry of Numbers
- Computational Geometry
- Algorithms Theory
- Applied Optimization