Exact solution of the robust knapsack problem

被引：49

作者：

Monaci, Michele ^{[1
]}

Pferschy, Ulrich ^{[2
]}

Serafini, Paolo ^{[3
]}

机构：

[1] Univ Padua, DEI, I-35131 Padua, Italy

[2] Graz Univ, Dept Stat & Operat Res, A-8010 Graz, Austria

[3] Univ Udine, DIMI, I-33100 Udine, Italy

来源：

COMPUTERS & OPERATIONS RESEARCH | 2013年 / 40卷 / 11期

基金：

奥地利科学基金会;

关键词：

Knapsack problem; Robust optimization; Dynamic programming; OPTIMIZATION; ALGORITHMS; PRICE;

D O I：

10.1016/j.cor.2013.05.005

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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. (c) 2013 The Authors. Published by Elsevier Ltd. All rights reserved.

引用

页码：2625 / 2631

页数：7

共 19 条

[1]

Alvarez-Miranda E, 4OR IN PRESS, DOI DOI 10.1007/S10288-013-0231-6

[2] The price of robustness [J].