Discrete Optimization

Optimization tasks that involve discrete decisions are ubiquitous in mathematics, industry, and business. Examples include the planning of transportation systems, e.g., public transport or gas transportation. Here, one has to choose among a set of discrete options, i.e., to select a certain integral number of objects (e.g., buses, frequencies, etc.) or to turn certain options on/off (e.g., to close a valve). These problems are modeled as mathematical optimization problems. Typically such problems become large in practice and are inherently hard to solve. Thus, we develop mathematical theory and techniques in order to solve them successfully.

The research group Discrete Optimization develops methods, algorithms, and software to deal with discrete optimization problems. In particular, methods from integer and combinatorial optimization are developed.

The research group Discrete Optimization currently is engaged in the following collaborative research projects:

Furthermore, Discrete Optimization was involved in the following finished projects: