Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 35, Issue 6, Pages 2034-2048Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2006.10.002
Keywords
knapsack problem; max-min combinatorial optimization; robust optimization
Ask authors/readers for more resources
We are concerned with a variation of the standard 0-1 knapsack problem, where the values of items differ under possible S scenarios. By applying the 'pegging test' the ordinary knapsack problem can be reduced, often significantly, in size; but this is not directly applicable to our problem. We introduce a kind of surrogate relaxation to derive upper and lower bounds quickly, and show that, with this preprocessing, the similar pegging test can be applied to our problem. The reduced problem can be solved to optimality by the branch-and-bound algorithm. Here, we make use of the surrogate variables to evaluate the upper bound at each branch-and-bound node very quickly by solving a continuous knapsack problem. Through numerical experiments we show that the developed method finds upper and lower bounds of very high accuracy in a few seconds, and solves larger instances to optimality faster than the previously published algorithms. (c) 2006 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available