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.

Contact

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.

News

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

Jan 29-31, 2020: Giorgio Lucarelli from Grenoble

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

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