Lars Rohwedder

activity

20242026

collaborators

4 papers

math.OC2026

Polyhedral extended formulations that approximate the Gomory closure for packing problems

Friedrich Eisenbrand, Samuel Fiorini, Lars Rohwedder +1

We consider $0/1$ packing problems $max {c^{T} x : A x \leq 1, x \in {0, 1}^{n}}$ , with $A \in R_{\geq 0}^{m \times n}$ . A way to solve such problems is via tighteni…

cs.DS2025

A k-swap Local Search for Makespan Scheduling

Lars Rohwedder, Ashkan Safari, Tjark Vredeveld

Local search is a widely used technique for tackling challenging optimization problems, offering significant advantages in terms of computational efficiency and exhibiting strong e…

cs.DS2025

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines

Lars Rohwedder

Given $n$ jobs with processing times $p_{1}, \dots, p_{n} \in N$ and $m \leq n$ machines with speeds $s_{1}, \dots, s_{m} \in N$ our goal is to allocate the jobs to machines minimi…

cs.DS2024

Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling

Lars Rohwedder, Ashkan Safari, Tjark Vredeveld

Local search is a widely used technique for tackling challenging optimization problems, offering simplicity and strong empirical performance across various problem domains. In this…