Integrality Gaps of Integer Knapsack Problems
Optimization and Control
2016-11-14 v1
Abstract
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastically smaller than the integrality gap that occurs in a worst case scenario.
Cite
@article{arxiv.1611.03768,
title = {Integrality Gaps of Integer Knapsack Problems},
author = {Iskander Aliev and Martin Henk and Timm Oertel},
journal= {arXiv preprint arXiv:1611.03768},
year = {2016}
}
Comments
Version submitted to IPCO 2017