Skip to main content

Combinatorial Optimization and Logistics

The Combinatorial Optimization and Logistics (CSLog) group at the University of Bremen focuses on the analysis of discrete algorithmic problems that are computationally difficult. We analyze the structure of such problems and design efficient algorithms with provable performance guarantees for solving them. We are also interested in combinatorial optimization problems where the input is revealed only incrementally or where there is uncertainty in the parameters, and we develop online, stochastic or robust solution methods.

Combinatorial optimization is related to theoretical computer science, discrete mathematics, operations research, algorithm theory and computational complexity theory and has important applications in several fields. In our group we develop theoretic results and apply them to complex real-world environments. Typical applications include scheduling, production planning, logistics, network design, communication and routing in networks, and health care.


Combinatorial Optimization and Logistics
Faculty 3 - Mathematics and Computer Science
Prof. Dr. Nicole Megow

Bibliothekstr. 5
28359 Bremen

Secretary office
Martina Mörz
Telefon: +49 (0) 421 218 63580


Research topics

  • approximation algorithms
  • online optimization
  • stochastic dynamic optimization
  • explorable uncertainty
  • scheduling and resource management
  • network design and routing
  • logistics applications


Jan 20, 2021 Our paper Speed-Robust Scheduling has been accepted for publication at IPCO

Dec 21, 2020 Our paper Throughput Scheduling with Equal Additive Laxity has been accepted for publication at CIAC

Oct 1, 2020 Alexander Lindermayr joins our group as a PhD student. Welcome!

Sep 30, 2020: Bertrand Simon leaves our group to join as a CNRS researcher the IN2P3 Computing Center, Villeurbanne/Lyon. Congratulations!

Jun 11, 2020 Our paper "Online Minimum Cost Matching with Recourse on the Line" has been accepted at APPROX 2020

Jul 1, 2020 Our paper "An Adversarial Model for Scheduling with Testing" has been accepted for publication at Algorithmica

Jun 1, 2020 Our paper "Online Metric Algorithms with Untrusted Predictions" has been accepted at ICML 2020

Feb 16-21, 2020: Dagstuhl Seminar: Scheduling, organized by Nicole Megow, David Shmoys and Ola Svensson

Feb 10-13, 2020: Andreas Wiese from Universidad de Chile is visiting us

Feb 01, 2020 Our paper "Scheduling on Two Types of Resources: a Survey" has been accepted for publication at ACM Computing Surveys

Jan 29-31, 2020: Giorgio Lucarelli from Grenoble

Dec 10, 2019: Volker Kaibel from OVGU Magdeburg speaks at the Mathematical Colloquium