Master Theses in Discrete Optimization
A Master Thesis in the field Discrete Optimization deals with specific questions coming from integer programming, graph theory or topics on polyhedra. It aims at independently analyzing mathematical properties of optimization algorithms or their underlying structures.
For planning the thesis, the following steps are crucial. In a first meeting, student and professor agree on a topic. Subsequently, the student has 4-6 weeks time to read up on the subject and to search the literature. Then the thesis is formally registered in the office of student affairs. A TeX-template is available in the section of the department’s website. Alternatively, you can use the template of the course “ Downloads” from winter term 2015/16. While writing the thesis it is strongly recommended to keep contact with your supervisor at least once per month. Approximately one month before submission you should meet with your supervisor! Arbeitstechniken
Having passed the exams to the courses “Introduction to Optimization” and “Discrete Optimization” or “Nonlinear Optimization” is mandatory. Furthermore, it is recommended to actively attend an optimization seminar.