2 citations · 6 across the 14 of their papers we have counts for
4 papers · 1 filter
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
Klaus Jansen, Alexandra Lassota, Marten Maack +1
This paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph and no two jobs connected by an edge are allowed to be assigned to the s…
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
Sebastian Berndt, Klaus Jansen, Alexandra Lassota
We consider ILPs, where each variable corresponds to an integral point within a polytope , i. e., ILPs of the form $\min\{c^{\top}x\mid \sum_{p\in\mathcal P\cap \mathb…
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called -stage stochastic. A -st…
Solving Packing Problems with Few Small Items Using Rainbow Matchings
Max Bannach, Sebastian Berndt, Marten Maack +4
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been st…