We study an important case of ILPs $\max\{c^Tx \ \vert\ \mathcal Ax = b, l \leq x \LEq u,\, x \in \mathbb{Z}^{n t} \} with $n\cdot t$ variables and lower and upper bounds $\ell, u\in\mathbb Z^{nt}$.Expand

Graph Balancing was the last one in a group of related problems from literature, for which it was open whether the configuration LP is stronger than previous, simple LP relaxations.Expand

Integer programs with a constant number of constraints are solvable in pseudo-polynomial time. We give a new algorithm with a better pseudo-polynomial running time than previous results. Moreover, we… Expand

We consider integer and linear programming problems for which the linear constraints exhibit a (recursive) block-structure: The problem decomposes into independent and efficiently solvable sub-problems if a small number of constraints is deleted.Expand