Skip to main content
Conference Proceedings

Integrality gaps of integer knapsack problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10328 LNCS 25-38
DOI: 10.1007/978-3-319-59250-3_3
6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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

CITATION STYLE

APA

Aliev, I., Henk, M., & Oertel, T. (2017). Integrality gaps of integer knapsack problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10328 LNCS, pp. 25–38). Springer Verlag. https://doi.org/10.1007/978-3-319-59250-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free