We study the general integer programming problem where the number of variables $ n $ is a
variable part of the input. We consider two natural parameters of the constraint matrix $ A …

We consider integer and linear programming problems for which the linear constraints
exhibit a (recursive) block-structure: The problem decomposes into independent and …

We study two classic variants of block-structured integer programming. Two-stage stochastic
programs are integer programs of the form {A ix+ D iyi= bi for all i= 1,…, n}, where Ai and Di …

Integer linear programs of configurations, or configuration IPs, are a classical tool in the
design of algorithms for scheduling and packing problems where a set of items has to be …

We give a strongly polynomial-time algorithm for integer linear programs defined by integer
coefficient matrices whose subdeterminants are bounded by a constant and that contain at …

N-fold integer programs (IPs) form an important class of block-structured IPs for which
increasingly fast algorithms have recently been developed and successfully applied. We …

Powerful results from the theory of integer programming have recently led to substantial
advances in parameterized complexity. However, our perception is that, except for Lenstra's …

We consider so called 2-stage stochastic integer programs (IPs) and their generalized form
of multi-stage stochastic IPs. A 2-stage stochastic IP is an integer program of the form\max …

In this article, we study the computational complexity of solving a class of block structured
integer programs (IPs), the so-called multistage stochastic IPs. A multistage stochastic IP is …

We consider fundamental algorithmic number theoretic problems and their relation to a class
of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage …