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
  • Deutsche Forschungsgemeinschaft
  • Emmy Noether
  • Mind Media Machines
  • Logdynamics
  • Data Science Center
  • Invasic


Sep 16, 2021: Felix Hommelsheim joins our group as a postdoc. Welcome!

Jul 31, 2021: Franziska Eberle leaves our group for a postdoc position at LSE, London. Congratulations!

Jun 23, 2021: Our paper Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty has been accepted for publication at ESA

Feb 19, 2021: Jens Schlöter receives the Faculty Award 2021 for his Master Thesis on "Conditional Directed Acyclic Graphs". Congratulations!

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

Nov 13, 2021: Franziska Eberle successfully defends her PhD thesis "Packing and Scheduling under Uncertainty"

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!