Specializing in Discrete Optimization
As a rule, Discrete Optimization offers a seminar every semester.
Furthermore, there are many interesting and applied thesis topics, often in cooperation with a company. Of course, we also offer theoretical and algorithmic topics from current discrete optimization research. There is a wide range of topics of completed and ongoing work:
Bachelor Theses
Examples:
- Gewichts-beschränkte kürzeste Wege Probleme
- A recognition algorithm for unit interval graphs
- Nichtnull-Strukturen von Hesse-Matrizen und Sternfärbung
Master Theses
Examples:
- Shortest Path with Conflicts
- Extended formulations and symmetry handling
- Schnittebenenverfahren zur Optimierung submodularer Funktionen
