2 citations · 6 across the 14 of their papers we have counts for
5 papers · 1 filter
Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides
Alexandra Lassota, Koen Ligthart
We present a new and faster algorithm for the 4-block integer linear programming problem, overcoming the long-standing runtime barrier faced by previous algorithms that rely on Gra…
Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns
Alexandra Lassota, Koen Ligthart
We study integer linear programs (ILP) of the form and analyze their parameterized complexity with respect to their dist…
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…