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 63580

Wordcloud

Research topics

  • approximation algorithms
  • online optimization
  • stochastic dynamic optimization
  • explorable uncertainty
  • learning-augmented algorithms (algorithms with predictions)
  • scheduling and resource management
  • network design and routing
  • logistics applications

Researchers

Nicole Megow

Prof. Dr. Nicole Megow

Bild von Dr. Felix Hommelsheim

Dr. Felix Hommelsheim

Mohit Garg

Mohit Garg, PhD

Bild von Alexander Lindermayr

M.Sc. Alexander Lindermayr

Lukas Nölke

M.Sc. Lukas Nölke

Jens Schlöter

M.Sc. Jens Schlöter

  • Go to page: Deutsche Forschungsgemeinschaft
  • Go to page: Emmy Noether
  • Go to page: Mind Media Machines
  • Go to page: Logdynamics
  • Go to page: Data Science Center
  • Go to page: Invasic

News

Oct 15, 2022: Our group (Alex, Jens, Nicole) participated in Campus City with puzzles on combinatorics and optimization in a joint event of Faculty 3 optimization research groups in Überseemuseum.

Oct 10, 2022: Theophile Thiery from Queen Mary University, London, is visiting us for a month. Welcome!

Sep 15, 2022: Our paper "A Universal Error Measure for Input Predictions Applied to Online Graph Problems" has been accepted at NeurIPS 2022!

Jun 20, 2022: Our paper "Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty" has been accepted at ESA 2022.

Jun 18, 2022: Alexander Lindermayr receives the Faculty Award 2022 for his Master Thesis on "Learning-Augmented Online Algorithms for the 2-Server Problem on the Line and Generalizations". Congratulations!

Jun 12-17, 2022: Our (former) group members give four talks at MAPSP 2022 in Oropa, Italy.

May 10, 2022: Our paper "Non-clairvoyant Scheduling with Predictions Revisited" has been accepted at SPAA 2022.

May 8, 2022: We launched the open source project https://algorithms-with-predictions.github.io/ with a collection on papers, workshops etc. around algorithms with predictions.

May 3, 2022: Nicole Megow gives an invited lecture on "Online Routing and Network Design with Predictions" at the Workshop on Algorithms with Predictions (ALPS) at Bernoulli Center, EPFL.

Apr 10, 2022: Our paper "Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults" has been accepted at SWAT 2022.

Dec 2, 2021: The book "Dynamics in Logistics: Twenty-Five Years of Interdisciplinary Logistics Research in Bremen, Germany" edited by Michael Freitag, Herbert Kotzab, Nicole Megow has been published. It includes our chapter "Explorable Uncertainty Meets Decision-Making in Logistics" (Nicole Megow and Jens Schlöter).

Dec 2, 2021: Our paper "Robustification of Online Graph Exploration Methods" has been accepted at AAAI 2022.

Nov 1, 2021: We welcome Mohit Garg. He has a joint position in our group and with Petra Berenbrink at Hamburg University.

Oct 31, 2021: Our paper "Double Coverage with Machine-Learned Advice" has been accepted at ITCS 2022.

Dec 6, 2021: Gauß-Vorlesung in Bremen, Haus der Wissenschaft, Festveranstaltung der DMV mit Hauptvortrag von Valentin Blomer (Bonn) und Verleihung des von-Kaven Preises der DFG. Organisation: Nicole Megow und Anke Pohl

Oct 29, 2021: Jens Schlöter gave an introductory talk at Campus City on mathematical optimization using the example of packing problems.

Sep 20, 2021: Our paper "Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time" has been accepted for publication at FSTTCS 2021.

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 2021.

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