Marco Lübbecke © (c) Jesus Tirso
Download digital business card


Prof. Dr. rer. nat. habil.

Marco Lübbecke


Chair of Operations Research


Room: B262

Kackertstraße 7

52072 Aachen

Consultation Hours

Wednesday, 11:00-12:00 hours


Marco Lübbecke was born in 1971. He studied mathematics at the TU Braunschweig, from where he graduated in 1996. He received a doctoral degree in mathematics from the same university in 2001. He wrote his post-doctoral Habilitation thesis in mathematics at the TU Berlin in 2007. During the academic year 2009/2010, he was a visiting professor for discrete optimization at the TU Darmstadt, before becoming a full professor and holder of the Chair of Operations Research at RWTH Aachen University in 2010. Marco Lübbecke's research is both theoretical and applied, and he views his work as highly interdisciplinary, feeling at home in operations research, algorithmic discrete mathematics, as well as theoretical computer science.

Research Interests

  • Algorithm engineering
  • Algorithmic discrete mathematics
  • Discrete and combinatorial optimization
  • Graph and network algorithms
  • Linear and integer programming
  • Mathematics of operations research

Selected Publications

  • 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). [pdf] [doi] [bib]
  • 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]