Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10347433 | Computers & Operations Research | 2013 | 7 Pages |
Abstract
We consider an uncertain variant of the knapsack problem in which the weight of the items is not exactly known in advance, but belongs to a given interval, and an upper bound is imposed on the number of items whose weight differs from the expected one. For this problem, we provide a dynamic programming algorithm and present techniques aimed at reducing its space and time complexities. Finally, we computationally compare the performances of the proposed algorithm with those of different exact algorithms presented so far in the literature for robust optimization problems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Michele Monaci, Ulrich Pferschy, Paolo Serafini,