Improvable Knapsack Problems
Optimization and Control
2016-07-29 v1 Data Structures and Algorithms
Abstract
We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the resulting classic knapsack problem yields maximum profit? We present a detailed analysis for several cases of improvable knapsack problems, presenting constant factor approximation algorithms and two PTAS.
Cite
@article{arxiv.1607.08338,
title = {Improvable Knapsack Problems},
author = {Marc Goerigk and Yogish Sabharwal and Anita Schöbel and Sandeep Sen},
journal= {arXiv preprint arXiv:1607.08338},
year = {2016}
}