3 citations · 11 across the 13 of their papers we have counts for
3 papers · 1 filter
Computing the covering radius of a polytope with an application to lonely runners
Jana Cslovjecsek, Romanos Diogenes Malikiosis, Márton Naszódi +1
We are concerned with the computational problem of determining the covering radius of a rational polytope. This parameter is defined as the minimal dilation factor that is needed f…
Packing minima and lattice points in convex bodies
Martin Henk, Matthias Schymura, Fei Xue
Motivated by long-standing conjectures on the discretization of classical inequalities in the Geometry of Numbers, we investigate a new set of parameters, which we call \emph{packi…
Complexity of linear relaxations in integer programming
Gennadiy Averkov, Matthias Schymura
For a set of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with is called the relaxation complexity…