Masterarbeiten

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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