Distances to lattice points in knapsack polyhedra

Aliev, Iskander ORCID: https://orcid.org/0000-0002-2206-9207, Henk, Martin and Oertel, Timm ORCID: https://orcid.org/0000-0001-5720-8978 2020. Distances to lattice points in knapsack polyhedra. Mathematical Programming 182 (1-2) , pp. 175-198. 10.1007/s10107-019-01392-1

Preview

PDF - Published Version Available under License Creative Commons Attribution. Download (346kB) | Preview

Abstract

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 upper bound can be significantly improved on average. As a corollary, we obtain an optimal upper bound for the additive integrality gap of integer knapsack problems and show that the integrality gap of a 'typical' knapsack problem is drastically smaller than the integrality gap that occurs in a worst case scenario. We also prove that, in a generic case, the integer programming gap admits a natural optimal lower bound

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Publisher:	Springer Verlag
ISSN:	0025-5610
Related URLs:	https://arxiv.org/abs/1805.04592
Date of First Compliant Deposit:	2 April 2019
Date of Acceptance:	11 March 2019
Last Modified:	04 May 2023 20:20
URI:	https://orca.cardiff.ac.uk/id/eprint/121278

Citation Data

Cited 7 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item