Switch to German Switch to English

Kontakt

Algorithmen und Komplexität
Lehrstuhl für Informatik 1
RWTH Aachen
Ahornstrasse 55
D-52074 Aachen

Sekretariat:
Erika Schlebusch
Informatikzentrum, E1
Raum 4023
Tel.: +49 (0) 241 80-21101

Word Cloud

New Paper at SAND 2025 28 Mar 2025

Our paper "Dynamic Debt Swapping in Financial Networks" (by Henri Froese, Martin Hoefer, Lisa Wilhelmi) was accepted at the 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025).



New Paper in Operations Research, Data Analytics and Logistics 14 Mar 2025

In events of distress, an available naval rescue vessel from a home station with the lowest response time is dispatched. But how should rescue vessels be allocated to home stations when their operational availability changes over time due to low tides? In our paper "Rescue Vessel Allocation in Tidal Waters of the North and Baltic Sea" (by Tom Mucke, Alexander Renneke, Finn Seesemann, Felix Engelhardt) we build a mathematical model for this problem. We show that optimizing expected response times to distress calls is NP-hard. However, we provide an Integer Programming formulation and propose two methods of simplifying the model. We then compare the effectiveness of the models in a case study based on real-world data. Results show that the simplified models can be solved to de facto optimality, outperforming the results attained by the full model. The paper has been accepted for publication in Operations Research, Data Analytics and Logistics (formerly known as Operations Research for Health Care).



New Paper at AISTATS 2025 24 Jan 2025

Our paper "Independent Learning in Performative Markov Potential Games" (by Rilind Sahitaj, Paulius Sasnauskas, Yiğit Yalın, Debmalya Mandal, Goran Radanovic) was accepted at the 28th International Conference on Artificial Intelligence and Statistics (AISTATS 2025), an international top conference at the intersection of machine learning and statistics.



New Paper at IPCO 2025 22 Jan 2025

Our paper "Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization" (by Christoph Grüne, Lasse Wulf) was accepted at the 26th Conference on Integer Programming and Combinatorial Optimization (IPCO 2025).