Discrete Mathematics, Optimization, and Convexity
At TUM, there is a large group of international researchers that work on various aspects of Discrete Mathematics, Optimization, and Convexity. We are based in the Department of Mathematics and cooperate closely with colleagues from the Department of Informatics and the School of Management. Several members of the group participate in the interdisciplinary DFG research training group AdONE.
We are mainly interested in the theory as well as in practical aspects of (optimization) problems that involve a large number of discrete decisions. Questions of this type are omnipresent in many industries and other settings. Examples include logistic, social and telecommunication networks, vehicle routing, scheduling, chip design, tomography, and health-care operations.
Together, we have expertise in many disciplines at the core or closely related to Discrete Mathematics, Optimization, and Convexity. Along with our national and international partners, we contribute to areas such as algorithmic game theory, approximation algorithms, combinatorial optimization, complexity theory, convex geometry, data analysis, extended formulations, geometric representations, graph algorithms, linear and integer programming, network design, operations research, polyhedral combinatorics, and scheduling.