[HTML][HTML] Distances to lattice points in knapsack polyhedra
We give an optimal upper bound for the ℓ _ ∞ ℓ∞-distance from a vertex of a knapsack
polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the …
polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the …
Distances to Lattice Points in Knapsack Polyhedra
I Aliev, M Henk, T Oertel - arXiv e-prints, 2018 - ui.adsabs.harvard.edu
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 …
knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show …
[PDF][PDF] Distances to lattice points in knapsack polyhedra
I Aliev, M Henk, T Oertel - Science, 2017 - d-nb.info
We give an optimal upper bound for the l∞-distance from a vertex of a knapsack polyhedron
to its nearest feasible lattice point. In a randomised setting, we show that the upper bound …
to its nearest feasible lattice point. In a randomised setting, we show that the upper bound …
[PDF][PDF] On Distances to Lattice Points in Knapsack Polyhedra
I Aliev, M Henk, T Oertel - cirm-math.fr
On Distances to Lattice Points in Knapsack Polyhedra Page 1 On Distances to Lattice Points
in Knapsack Polyhedra I. Aliev, M. Henk and T. Oertel Cardiff University UDT 2018 I. Aliev, M …
in Knapsack Polyhedra I. Aliev, M. Henk and T. Oertel Cardiff University UDT 2018 I. Aliev, M …
Distances to Lattice Points in Knapsack Polyhedra
I Aliev, M Henk, T Oertel - arXiv preprint arXiv:1805.04592, 2018 - arxiv.org
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 …
knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show …
Distances to lattice points in knapsack polyhedra.
I Aliev, M Henk, T Oertel - Mathematical Programming, 2020 - search.ebscohost.com
We give an optimal upper bound for the ℓ∞-distance from a vertex of a knapsack
polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the …
polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the …
Distances to lattice points in knapsack polyhedra
I Aliev, M Henk, T Oertel - Mathematical Programming, 2020 - orca.cardiff.ac.uk
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 …
knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show …