Exact solution of the robust knapsack problem

Authors:
Michele Monaci;Ulrich Pferschy;Paolo Serafini
Affiliations:
-;-;-
Venue:
Computers and Operations Research
Year:
2013

Citing 8
Cited 0

Dynamic programming revisited: improving knapsack algorithms

Computing - Special issue on combinatorial optimization
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science
The Price of Robustness

Operations Research
Where are the hard knapsack problems?

Computers and Operations Research
Recoverable robust knapsacks: Γ-scenarios

INOC'11 Proceedings of the 5th international conference on Network optimization
Theory and Applications of Robust Optimization

SIAM Review
A robust approach to the chance-constrained knapsack problem

Operations Research Letters
Technical Note---Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations

Operations Research

Quantified Score

Hi-index	0.01

Visualization

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.