Research of the Operations Research Group

Operations Research pursues is an interdisciplinary approach and combines aspects of applied mathematics, quantitative business administration and algorithmic computer science. Operations research develops mathematical models, investigates their theoretical properties and applies them for actual planning problems. Our research group is focused on Discrete Optimization with an impressive publication record in highly esteemed international peer-reviewed journals. Research topics include approximation algorithms, worst-case analysis of heuristics, computational complexity and algorithmic graph theory. Further topics are social choice theory and applied statistics. The group is involved in numerous international research cooperations.

The Operations Research group also works on applied projects with industrial and institutional partners, often supported by applied research grants. In these projects we frequently develop and implement integer linear programming (ILP) models and heuristic approximation algorithms. Typical application areas are production planning, scheduling, transportation and routing, packing and cutting, personal planning and any kind of resource allocation.