Abstract Machine scheduling problems are a long-time key domain of algorithms and
complexity research. A novel approach to machine scheduling problems are fixed …

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 …

Many fundamental NP NP-hard problems can be formulated as integer linear programs
(ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the …

We consider integer programming problems $\max\{c^ T x:\mathcal {A} x= b, l\leq x\leq u,
x\in\mathbb {Z}^{nt}\} $ where $\mathcal {A} $ has a (recursive) block-structure generalizing" …

Scheduling problems involving a set of dependent tasks with release dates and deadlines
on a limited number of resources have been intensively studied. However, few …

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 consider integer and linear programming problems for which the linear constraints
exhibit a (recursive) block-structure: The problem decomposes into independent and …

We study an important case of integer linear programs (ILPs) of the form \max{c^Tx\vert\
mathcalAx=b,l≦x≦u,\,x∈Z^nt\} with nt variables and lower and upper bounds …

We consider the standard ILP Feasibility problem: given an integer linear program of the
form {A x= b, x⩾ 0}, where A is an integer matrix with k rows and ℓ columns, x is a vector of ℓ …

The starting point of this paper is the problem of scheduling n jobs with processing times and
due dates on a single machine so as to minimize the total processing time of tardy jobs, ie …