Dr. rer. nat. habil., Universitätsprofessor

Marco Lübbecke

Marco Lübbecke
Lehrstuhl für Operations Research


Raum: B262

Kackertstraße 7

52072 Aachen


Telefon: +49 241 80 93362
Fax: +49 241 80 92369


Vor Oktober 2018 finden keine regelmäßigen Sprechstunden statt. Bitte vereinbaren Sie per Email einen individuellen Termin.

Persönliche Daten

Marco Lübbecke, born 1971, studied mathematics at TU Braunschweig where he graduated in 1996. He received a
doctoral degree in mathematics from the same university in 2001. He completed his habilitation thesis in mathematics at TU Berlin in 2007. During the academic year 2009/2010 he was a visiting professor for discrete optimization at TU Darmstadt, before he became a full professor and chair of operations research at RWTH Aachen in 2010. Marco's research has been both, theoretical and applied, and he understands his work as truely insterdisciplinary: he feels home in operations research, algorithmic discrete mathematics, as well as theoretical computer science.


  • algorithm engineering
  • algorithmic discrete mathematics
  • discrete and combinatorial optimization
  • graph and network algorithms
  • linear and integer programming
  • mathematics of operations research

Ausgewählte Veröffentlichungen

  • Bergner, M.; Lübbecke, M.; Witt, J. (2016): A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. In: Journal of Experimental Algorithmics 21 (1).
  • M. Bergner; A. Caprara; A. Ceselli; F. Furini; M.E. Lübbecke; E. Malaguti; E. Traversi (2015): Automatic Dantzig–Wolfe reformulation of mixed integer programs. In: Math. Prog. 149(1-2), 391-424. [pdf] [doi] [bib]
  • J.B. Gauthier; J. Desrosiers; M.E. Lübbecke (2015): Tools for primal degenerate linear programs: IPS, DCA, and PE. In: EURO Journal on Transportation and Logistics. [pdf] [doi] [bib]
  • M.E. Lübbecke (2015): Comments on: An Overview of Curriculum-Based Course Timetabling. In: TOP, accepted [doi] [bib]
  • E.T. Coughlan; M.E. Lübbecke; J. Schulz (2015): A Branch-Price-and-Cut Algorithm for Multi-Mode Resource Leveling. In: European J. Oper. Res., 245, 70-80.
  • M. Bergner; M.E. Lübbecke; J.T. Witt (2014): A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. In: J. Gudmundsson und J. Katajainen (Hrs.) Experimental Algorithms - SEA 2014. Springer, Berlin, Lect. Notes Comput. Sci. 8504, 34-45. [pdf] [doi] [bib]
  • J. Desrosiers; J.B. Gauthier; M.E. Lübbecke (2014): Row-reduced Column Generation for Degenerate Master Problems. In: European J. Oper. Res., 236(2), 453-460. [pdf] [doi] [bib]
  • S. Kirchner; M. Lübbecke (2014):Dynamische Vergabe von Patiententerminen in Krankenhäusern . In: M. Lübbecke, A. Weiler und B. Werners (Hrs.) Zukunftsperspektiven des Operations Research: Erfolgreicher Einsatz und Potenziale. Springer Gabler. [doi] [www] [bib]
  • J.B. Gauthier; J. Desrosiers; M.E. Lübbecke (2014, in press): About the minimum mean cycle-canceling algorithm. In: Discrete Appl. Math. [pdf] [doi] [bib]
  • J.B. Gauthier; J. Desrosiers; M.E. Lübbecke (2014):Decomposition theorems for linear programs. In: Oper. Res. Lett., 42(8), 553-557. [pdf] [doi] [bib]