![[Translate to English:]](/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/CSLog.png)
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 particularly 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. Recently, we focused on data-driven and learning-augmented 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 & Computer Science
Prof. Dr. Nicole Megow
Bibliothekstr. 5
28359 Bremen
Secretary office
Caroline Mintert
Telefon: +49 (0) 421 218 63580
![[Translate to English:] Bild von Moritz Buchem](/fileadmin/_processed_/d/a/csm_IMG_5434_0981593ab0.jpg)
News
July 8, 2025: Our paper "A Little Clairvoyance Is All You Need" (Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schl?ter, Sorrachai Yingchareonthawornchai) got accepted at FOCS 2025!
July 7, 2025: The ICALP 2025 Satellite Workshop on Theory and Applications of Algorithms with Predictions (TAAP25) is being organized by Spyros Angelopoulos, Antonios Antoniadis, Marek Eliá?, Lene Favrholdt, and Nicole Megow.
July 1-4, 2025: Nicole is speaking, and Bart and Morten are participating at the PhD School on Intersections of Algorithms and Machine Learning Theory, held in Odense, DK.
June 11-13, 2025: IPCO 2025 took place at Johns Hopkins University in Baltimore, US, with Nicole as PC chair.
May 22, 2025: Great success for Bremen’s research community: the Cluster of Excellence The Martian Mindset has been approved, and we are proud to be part of it.
May 13-14, 2025: Bremen-Hamburg Colloquium on Algorithms, Combinatorics and Optimization at U Hamburg.
Mar 25, 2025: Nicole speaks about "Query Minimization for Stochastic Selection Problems" at the Dagstuhl Seminar on Approximation Algorithms for Stochastic Optimization .
Mar 16-21, 2025: Dagstuhl Seminar on Scheduling and Fairness organized by Claire Mathieu, Nicole Megow, Ben Moseley, Frits Spieksma
Feb 01, 2025: Our paper "A 5/4-Approximation for Two-Edge Connectivity" (Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli and Alexander Lindermayr)got accepted at STOC 2025!
Dec 13, 2024: Our paper "Protecting the Connectivity of a Graph under Non-uniform Edge Failures" (Felix Hommelsheim, Zhenwei Liu, Nicole Megow, Guochuan Zhang) got accepted at STACS 2025.
Nov 28-29, 2024: Bremen Workshop on Combinatorial Reconfiguration and Beyond, organized by Nicole Megow, Daniel Schmand, and Sebastian Siebertz as part of their MMM Seed Project.
Nov 22, 2024: Alex Lindermayr successfully defended his PhD thesis "Unrelated Machine Scheduling in Different Information Models". Congratulations!
Nov 18, 2024: We are very happy to have Annette Lutz (TU Darmstadt) as a guests. She gave a talk about the "Incremental Prize-Collecting Steiner Tree Problem" in our research seminar.
Nov 6, 2024: We are excited to have Sarah Morell (TU Berlin) as a guest. She gave an interesting talk about the submodular Santa Claus problem in our research seminar.
Oct 14, 2024: Our paper "A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing" (Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer) got accepted at SODA 2025.
Oct 14, 2024: Our paper "The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints" (Sven J?ger, Alexander Lindermayr, Nicole Megow) got accepted at SODA 2025.
Sep 26, 2024: Our paper "Accelerating Matroid Optimization through Fast Imprecise Oracles" (Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schl?ter) got accepted at NeurIPS 2024.
Sep 23-27, 2024: Our "Hands-On Tutorial on Optimization" will take place in MZH 5500, daily from 9am till 5pm. Special event on Wednesday: Talk with insights about Solving Optimization Problems in Practice by Industry Process Consultants from DELMIA Quintiq, Düsseldorf
Sep 1, 2024: PhD student Leoni Winschermann from the University of Twente joins our group as a research visitor for four months. Welcome!
August 1, 2024: Call for Papers for IPCO 2025 is out! Nicole Megow is the PC Chair. Please consider submitting!