This paper presents an anlysis of the NP-hard minimization problem min{b...
In this paper we show that every maximum minimum-cost flow over time pro...
For a matrix W ∈ℤ^m × n, m ≤ n, and a convex
function g: ℝ^m →ℝ, we are ...
Let A ∈ℤ^m × n be an integral matrix and a, b, c
∈ℤ satisfy a ≥ b ≥ c ≥ ...
We consider the problem of solving integer programs of the form min{ c^⊺...
We consider N-fold integer programming problems. After a decade of conti...
In 1983 Lenstra showed that an integer program (IP) is fixed parameter
t...
In subset selection we search for the best linear predictor that involve...