title: Exact solution of the robust knapsack problem.
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.
authors.affiliation: DEI, University of Padova, Via Gradenigo 6/A, I-35131 Padova, Italy.
authors.forename: Michele
authors.initials: M
authors.lastname: Monaci
authors.forename: Ulrich
authors.initials: U
authors.lastname: Pferschy
authors.forename: Paolo
authors.initials: P
authors.lastname: Serafini
keywords: Dynamic programming; Knapsack problem; Robust optimization