Theses

We welcome applications by Bachelor and Master students. If you are interested in writing your thesis with our group, please follow the instructions for math students or the instructions for students from the School of Management. whichever applies to you.

Ongoing

MASTER'S THESES

Optimizing Yard Operations in Steel Plate Storage Facilities
Identification of Duplicate Companies in Large Databases
Clustering approaches for vehicle routing with time windows on real-world data
A Strengthening of the Gomory-Chvátal Cutting-Plane Procedure for 0/1-Polytopes

 

BACHELOR'S THESES

Generalizations of Hall’s Marriage Theorem
 

Completed

MASTER'S THESES

Optimization of drone-assisted delivery services 2021
Local search algorithms for vehicle routing in the logistics industry 2021
A Weighted Matching Model for Georeferenced Microsimulations 2021
Iterative Combinatorial Auctions: Improved Running Time via Machine Learning 2021
Experimental Evaluation of Robust Revenue-Maximizing Auctions 2021
Concurrent Open Shop and Coflow Scheduling 2021
Online path planning in an automated transit network station 2021
Secretary Problem: Numerical and Learning Analyses for the Variants of the Problem 2021
Detecting Influence Structures in Multi-Agent Reinforcement Learning System 2021

Robust appointment scheduling and the ariplane refueling problem

2021
A Study of the Hotelling Game with Capacity Constraints 2020
Equilibria Dynamics in Congestion Games 2020
Smoothed complexity on the local max-cut problem 2020
Truthful scheduling of unrelated machines 2020

Hospital Staff Scheduling

2020

Optimizing Multiple Linear Regression through Integer Programming

2020

Full Truckload Routing in the Logistics Industry 2020
New Methods for Transplantation Planning in Realistic Kidney Exchange Networks 2020
A Stochastic Routing Problem with Applications in Security Planning 2019
Implementation of Optimization Schemes for the Vehicle Routing Problem with Time Windows 2019
Pareto Optimal Matchings 2019
Approximation Algorithms for Location Routing with Depot Capacities 2019
Machine Learning for Multistage Stochastic Optimization Problems 2019
New Approximation Algorithms for Minsum Scheduling Problems 2019
The Complexity of Station Repacking 2019
Stochastic Optimization of Storage Capacity in the German Renewable Energy Network 2019
Oracle-Reducibility in the Context of Local Search 2018
Maintaining Perfect Matchings at Low Cost 2018
Shortest Path Problems with Cost-Sharing 2018
The Net Present Value Problem 2018
The Extension Complexity of Polyhedra in Combinatorial Optimization 2018
Parametric Combinatorial Optimization Problems and Their Complexity 2018
Benefits of Implementing a Kidney Exchange Program in Germany 2018
Variations of the Robust Network Flow Problem 2018
Inventory Optimization in a Medium-Sized Company 2018
Minimizing Overflow in Homeless Shelters via Online Scheduling Techniques 2018
Combinatorial Approaches to Prize-Collecting Graph Problems 2017
Scheduling with Position-Dependent Speed 2017
Supply Chain Inventory Management and the Effects of Lead-time Variability 2016
Multichannel Assortment Optimization 2016

BACHELOR'S THESES

Deterministic Algorithms for Dynamic Connectivity 2021
Lower Bounds on the PoS in Undirected Broadcast Games with Fair Cost Sharing 2021
Maximum-weight partition into rectangles 2020
Voronoi diagrams and applications 2020
Modified Gomory-Chvátal cuts for polytopes in the unit cube 2020
Computation of the split polytope 2020
Delaunay triangulation and minimum spanning trees 2020
Combinatorial auctions and linear optimization 2020
Algorithms for the computation of convex hulls 2020
Verifying neural networks with discrete optimization 2020

A Comparison of Different Surgery Scheduling Models

2018

Simplicity and Optimality in Auction Design 2018
Clustering Directed Graphs Using an Effective Resistance Preserving Transformation 2017
Online Scheduling Problems with Random Arrivals 2017
Robust Appointment Scheduling 2016

INTERDISCIPLINARY PROJECTS

Computational Evaluation of Lemke's Algorithm for Thin Flows with Resetting 2021
Analyse und Implementierung der TripBundle-Optimierung 2020
Computational Evaluation of Lemke's Algorithm for Thin Flows with Resetting 2020
Implementation of Optimization Schemes for the Vehicle Routing Problem with Time Windows 2019
Approximation Algorithms for Scheduling Jobs with Precedence Constraints and Release Dates 2019