Dr. Rer. Nat. Habil. Volker Kaibel
Professor
Mathematics
Otto von Guericke University Magdeburg
Germany
Biography
Since 2007 Professor (W3) for Mathematical Optimization at Otto-von-Guericke University Magdeburg 2006 Visiting Professor at TU Berlin 2003-2006 Private lecturer at TU Berlin 2005-2006 Deputy Head of Department for Optimization at the Zuse Institute Berlin (ZIB) 2003-2004 Head of the Research Center for Optimization at the DFG Research Center MATHEON, Berlin 2003-2004 Member of the Executive Board of the DFG Research Center MATHEON, Berlin 2005-2006 Scientist in Charge for Application Area B Logistics, Traffic and Telecommunication Networks of the DFG Research Center MATHEON, Berlin 2003 Visitor at the Mathematical Sciences Research Institute (MSRI), Berkeley (October-November) 1999-2003 Researcher (Research Assistant) at TU Berlin (with Günter M. Ziegler) 2002 Habilitation (Mathematics) at TU Berlin 1993-1999 Researcher (Research Assistant) at University of Cologne (with Michael Jünger) 1997 Doctoral Degree (Ph.D.) at the University of Cologne (supervisor: Michael Jünger, Thesis: Polyhedral Combinatorics of the Quadratic Assignment Problem) 1993 Diploma (Mathematics) at University of Cologne (supervisor: Michael Jünger, Thesis: Delaunay triangulations in different metrics) 1989-1993 Student of Mathematics and Computer Science, University of Cologne
Research Interest
My scientific work area is discrete mathematics with a strong emphasis on optimization and geometry. The spectrum of discrete optimization methods includes telecommunications, transport planning or logistics. As a rule of thumb can be used: Discreet optimization is always required if there is too many solutions for a task to try them out and compare their quality. Mathematical analysis of the problem can lead to unimagined improvements.
Publications
-
Kaibel, Volker; Thomas, Rekha Lifts of convex sets in optimization In: Mathematical programming: Series A, Series B; a journal of the Mathematical Programming Society. - Berlin: Springer, Vol. 153.2015, 1, p. 1-3
-
Conforti, Michele; Kaibel, Volker; Walter, Matthias; Weltge, Stefan Subgraph polytopes and independence polytopes of count matroids In: Operations research: A journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [ua]: Elsevier Science, Vol. 43.2015, 5, pp. 457-460
-
Kaibel, Volker; Lee, Jon; Walter, Matthias; Weltge, Stefan For more information, see the following article (s) in this publication. In: Graphs and combinatorics - Tokyo: Springer-Verl. Tokyo, Vol. 32.2016, 5, pp. 1931-1944, 322016 5 1931-1944; http://dx.doi.org/10.1007/s00373-016-1709-8
-
Averkov, Gennadiy; Kaibel, Volker; Weltge, Stefan Maximum semidefinite and linear extension complexity of families of polytopes In: De.arxiv.org - [Sl]: Arxiv.org, altogether 11 pp., 2016, 2016 11; http://arxiv.org/pdf/1605.08538v1.pdf