| Article ID: | iaor20133242 |
| Volume: | 39 |
| Issue: | 2 |
| Start Page Number: | 118 |
| End Page Number: | 120 |
| Publication Date: | Mar 2011 |
| Journal: | Operations Research Letters |
| Authors: | Woeginger Gerhard J, Deineko Vladimir G |
| Keywords: | knapsack problem |
We identify a polynomially solvable special case of the bounded knapsack problem that is characterized by a set of simple inequalities relating item weight ratios to item profit ratios. Our result generalizes and extends a corresponding result of Zukerman, et al. (2001) for the unbounded knapsack problem.