| Article ID: | iaor20115400 |
| Volume: | 213 |
| Issue: | 2 |
| Start Page Number: | 384 |
| End Page Number: | 387 |
| Publication Date: | Sep 2011 |
| Journal: | European Journal of Operational Research |
| Authors: | Woeginger Gerhard J, Deineko Vladimir G |
| Keywords: | knapsack problem |
We investigate a special case of the unbounded knapsack problem in which the item weights form an arithmetic sequence. We derive a polynomial time algorithm for this special case with running time