Distances to Lattice Points in Knapsack Polyhedra

Iskander Aliev, Martin Henk, Timm Oertel

We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the…