| Vortragender | | Termin | Raum | Thema | |
| Laura Klein | TU Dortmund | Do, 26.04.12, 14:00-15:00 | M/515 | Separation Algorithms for Quadratic Combinatorial Optimization Problems |
| Amelie Eilken | TU Dortmund | Do, 29.03.12, 14:00-15:00 | M/515 | Lattice-point free ellipsoids for Integer Quadratic Programming |
| Ines Werner | Universität zu Köln | Do, 08.03.12, 15:00-16:00 | M/515 | Approximationsalgorithmen für Mean-Risk Probleme |
| Marco Kujat | TU Dortmund | Fr, 03.02.12, 15:00-16:00 | M/515 | Varianten des Spannbaumproblems |
| Marius Radermacher | TU Dortmund | Mo, 23.01.12, 15:00-16:00 | M/515 | Heuristiken und exakte Methoden für die quadratische kombinatorische Optimierung |
| Ruth Hübner | Universität Göttingen | Mi, 16.11.11, 17:00-18:00 | M/611 | When is rounding allowed? A level set approach to integer nonlinear optimization. |
| Anita Schöbel | Universität Göttingen | Mi, 16.11.11, 16:00-17:00 | M/611 | A geometric solution algorithm for mixed continuous and combinatorial optimization problems |
| Anna Ilyina | TU Dortmund | Mo, 31.10.11, 10:00-11:00 | M/515 | Semidefinite Relaxierungen und andere Ansätze zur Lösung von nicht-konvexen quadratischen gemischt-ganzzahligen Optimierungsproblemen |
| Katharina Ruikis | TU Dortmund | Fr, 28.10.11, 14:30-15:30 | M/515 | Portfolio-Optimierungsprobleme |
| Felix Wegener | TU Dortmund | Di, 30.8.11, 14:00-15:00 | M/515 | Unbeschränkte ganzzahlige quadratische Optimierung mit Eigenwert Null |
| Christin Otto | TU Dortmund | Di, 30.8.11, 13:00-14:00 | M/515 | Relaxierungen quadratischer Modelle für Hub Location Probleme |
| Mauro Piacentini | Universität La Sapienza, Rom | Fr, 20.5.11, 11:00-12:00 | M/614 | An Eigenvalue optimization approach to the Vertex-Separator Problem in Graphs |
| Marianna De Santis | Universität La Sapienza, Rom | Fr, 20.5.11, 10:00-11:00 | M/614 | Continuous approaches for mixed 0-1 programming problems |
| Laura Klein | TU Dortmund | Do, 31.3.11, 14:00-15:00 | M/515 | Disjunctive Cuts and Target Cuts for 0/1-Problems with Quadratic Objective Function |
| Sebastian Berckey | TU Dortmund | Di, 15.2.11, 15:00-16:00 | M/515 | Lagrange-Dekomposition für Range Assignment-Probleme |
| Sebastian Meiswinkel | TU Dortmund | Di, 15.2.11, 14:00-15:00 | M/515 | Bessere Separationsmöglichkeiten durch dichtere Separationsgraphen |
| Long Trieu | TU Dortmund | Di, 7.12.10, 12:00-13:00 | M/515 | Using Convex Quadratic Programming for Solving Convex Nonlinear Integer Programs |
| Emiliano Traversi | Universität Bologna | Di, 16.11.10, 12:00-13:00 | M/911 | Optimal Linear Arrangements Using Betweenness Variables |
| Joe Naoum-Sawaya | University of Waterloo | Di, 27.7.10, 15:00-16:00 | M/511 | An Interior-Point Benders based Branch-and-Cut Algorithm for Mixed Integer Programs |
| Bissan Ghaddar | University of Waterloo | Di, 27.7.10, 14:00-15:00 | M/511 | Solving Non-convex Binary Quadratic Polynomial Problems via Second-order Cone Programming |
| Sara Mattia | TU Dortmund | Mo, 28.6.10, 16:00-17:00 | M/515 | Some Network Design Problems |
| Frank Baumann | TU Dortmund | Mo, 28.6.10, 15:00-16:00 | M/515 | Submodular Formulations for Range Assingment Problems |