This paper presents an anlysis of the NP-hard minimization problem min{b...
For a matrix W ∈ℤ^m × n, m ≤ n, and a convex
function g: ℝ^m →ℝ, we are ...
We show that the problem of deciding whether a given Euclidean lattice L...
We study the general integer programming problem where the number of
var...
In a seminal work, Micciancio & Voulgaris (2010) described a determinist...
We consider integer programming problems { c^T x : A x = b,
l ≤ x ≤ u, x...