Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Facebook. Yet at activating data is transmitted to third parties.Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Twitter. Yet at activating data is transmitted to third parties.Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Google. Yet at activating data is transmitted to third parties.Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Xing. Yet at activating data is transmitted to third parties.

We offer and supervise bachelor's and master's theses in operations research and mathematical optimization for students of mathematics, computer science, business administration, economics, and engineering. Topics range from theoretical, fundamental work to a participation in practical projects. Usual prerequisites are a solid knowledge in discrete and integer optimization, algorithms, and modeling of optimization problems. For most topics, strong implementation skills are a must.

Theses can be written in German or English. Very few topics require the command of the German language, these topics are only described in German.

If you are looking for a particular topic in operations research and mathematical optimization, please contact Marco Lübbecke.


Some advice on topics, preparation of a thesis, and our expectations and grading is provided here soon. The lists of open and completed theses will be available as well in the near future. (open topics are visible only from within the RWTH network)

Theses


Filter:

Theses Completed

Title Student Year Type
The Consecutive Dinner Problem Britta Grimm 2015 M.Sc.
Erzeugen von Treppenstufenformen in Matrizen Christina Schoenen 2012 M.Sc.
Gesamtheitliche Prozesskettensimulation Mehmet Ali Sener 2011 B.Sc.
Train Timetabling Problem Dominique Achard 2010 B.Sc.
Bikriterielle Kürzeste-Wege-Probleme: Theorie Maria Skoutarianou 2010 Dipl
A cutting plane algorithm for graph coloring Lena Maria Schwan 2010 B.Sc.
Atomic routing games on maximum congestion Ann-Kathrin Heyse 2010 B.Sc.
Aufspannende Teilgraphen mit kürzesten Umwegen Christoph Werner Acker 2010 B.Sc.
Flottenplanung von Flugzeugen Sebastian Erik Vock 2010 B.Sc.
A Branch-and-Price Approach for Resource Leveling Eamonn Thorsten Coughlan 2010 Dipl
Generic Branch-Cut-and-Price Gerald Gamrath 2010 Dipl