DIssertation Theses

Dissertation Theses

Dissertation theses usually deal with complex mathematical optimization problems for which no efficient solution methods exist so far. Often such optimization problems are motivated by practical applications in industry, economics or engineering sciences. The investigated optimization problems all contain the common structure of discrete decisions, i.e., either yes/no (0/1) decisions or integer numbers. Typically, such optimization tasks can be formulated via mixed-integer linear or nonlinear optimization problems (MIP or MINLP). A dissertation thesis usually includes the development of a solution method, based on a mathematical analysis of the corresponding mathematical structures. The solution methodology is mostly tested on real-world or realistic data.

Dissertation Theses in Progress

  • Competitive analysis of the online dial-a-ride problem
    Alexander Birx (Prof. Disser)
  • Ilhan Gören (Prof. Pfetsch)
  • Mixed-Integer Optimization with Differential Equations
    Oliver Habeck (Prof. Pfetsch)
  • The complexity of Zadeh's pivot rule
    Alexander Hopp (Prof. Disser)
  • Sparse Optimization in Signal Processing
    Frederic Matter (Prof. Pfetsch)
  • Interdiction Problems in Mixed-Integer Nonlinear Programming
    Andreas Schmitt (Prof. Pfetsch)

Finished Dissertation Theses

2019

2018

2017

2015

2013