Sven Fleischer (2019). Verwendung des Analytischen Zentrums innerhalb eines MIP-Lösers. TU Berlin

Jan Merlin Viernickel (2019). Improving Domain Propagation in Mixed Integer Programming via Conflict Graph based Reformulation. TU Berlin

Simon Wohlfahrt (2019). A conflict Minimization Approach for Railway Truck Allocation. TU Berlin

Fabian Wegschneider (2019). Exploiting Symmetry in MIP. TU Berlin

Stefan Maak (2019). A Separation Heurisitc for Quadratically Constraint Programming using Decomposition. TU Berlin

Kais Montassar (2019). Computing energy efficient routes for ships. TU Berlin

Ansgar Rössig (2019). Verification of Neural Networks. TU Berlin

Henriette Franz (2019). Connected Subgraphs with Budget Constraints: Formulations and Algorithms. TU Berlin

Mats Torre Olthoff (2019). Ein gemischt-ganzzahliger Programmierungsansatz für das Tourenplanungssystem mit zeitkritischen Gütern. TU Berlin

André Weltsch (2018). Fast Approximation of Equations of transient Gasflow. TU Berlin

Svenja Uslu (2018). Enhancing a parallel interior point method for solving large-scale linear programs with general arrowhead structure. TU Berlin

Lovis Anderson (2018). The Computation of the Volume of the Union of Polytopes via a Sweep-Plane Algorithm. TU Berlin

Jenia Scheizel (2018). A first flow based heuristic for MIP modelled SCM problems. TU Berlin

Mona Setje-Eilers (2018). Time series forecasting with mathematical programming. TU Berlin

Andreas Teuchert (2017). Degeneriertheit im Simplex-Verfahren. TU Berlin