Discrete Optimization deals with optimization problems in which all or some of the variables may only assume integer values. For example, most combinatorial optimization problems can be modelled in this way. The topics of the lecture include basic concepts of complexity theory as well as algorithmic and polyhedral approaches to discrete optimization.
Registration for this lecture is possible via the LSF system. Link to the Modulhandbuch Mathematik (in German)