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 59881

Research topics

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

Zuhörer in einem vollen Hörsaal.


Sep 1, 2020 Our paper "Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments" has been accepted for publication at ACM Journal of Experimental Algorithmics

Jun 29, 2020 Our paper "Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics" has been accepted at MFCS 2020

Jun 18, 2020 Our paper "Optimally Handling Commitment Issues in Online Throughput Maximization" has been accepted at ESA 2020

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 10, 2020 Our paper "Scheduling on Hybrid Platforms: Improved Approximability Window" has been accepted at LATIN Symposium 2020

Feb 03, 2020 Our paper "A general framework for handling commitment in online throughput maximization" has been published in issue 183 of Mathematical Programming

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

Jan 19, 2020 Our paper "On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems" has been accepted at IPDPS 2020

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

Dec 2, 2019 Our paper "Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice" has been accepted at NG-RES Workshop 2020

Sep 1, 2019: new Phd student Jens Schlöter ist joining

Jun 11-14, 2019: Julian Mestre from The University of Sydney is visiting us

April 10-12, 2019: Ulrich Pferschy from Graz is visiting