| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428500 | Information Processing Letters | 2015 | 5 Pages |
•We introduce an optimization problem which is related to knapsack.•We give an upper bound of 1/2+ε1/2+ε on the performance guarantee of any approximation algorithm (unless P=NPP=NP).•An approximation algorithm with almost matching lower bound is provided.
We introduce and study the approximability of the following problem. There is a set of useful objects that are available for purchase, and another set of useless objects that can be sold. Selling useless objects generates revenue which allows to acquire useful objects. We search for a sequence of decisions (buying or selling objects) which optimizes either the number of purchased objects or their global utility. One of the constraints is that, at any time, only a limited amount of money can be held.
