Exact solution of the robust knapsack problem

被引：48
|
作者：
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
相关论文
共 50 条
  • [31] EXACT METHODS FOR THE KNAPSACK-PROBLEM AND ITS GENERALIZATIONS
    DUDZINSKI, K
    WALUKIEWICZ, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 28 (01) : 3 - 21
  • [32] Reduction and exact algorithms for the disjunctively constrained knapsack problem
    Senisuka, Aminto
    You, Byungjun
    Yamada, Takeo
    Operations Research and Its Applications, 2005, 5 : 241 - 254
  • [33] An exact algorithm for the knapsack sharing problem with common items
    Fujimoto, M
    Yamada, T
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 171 (02) : 693 - 707
  • [34] An empirical analysis of exact algorithms for the unbounded knapsack problem
    Becker, Henrique
    Buriol, Luciana S.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 277 (01) : 84 - 99
  • [35] An exact decomposition algorithm for the generalized knapsack sharing problem
    Dahmani, Isma
    Hifi, Mhand
    Wu, Lei
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (03) : 761 - 774
  • [36] Formulations and algorithms for the recoverable -robust knapsack problem
    Buesing, Christina
    Goderbauer, Sebastian
    Koster, Arie M. C. A.
    Kutschka, Manuel
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2019, 7 (01) : 15 - 45
  • [37] Lexicographic α-robust knapsack problem :: Complexity results
    Kalai, Rim
    Vanderpooten, Daniel
    2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1103 - 1107
  • [38] Solution of the knapsack problem by deoxyribonucleic acid computing
    Aoi, Yohei
    Yoshinobu, Tatsuo
    Tanizawa, Katsuyuki
    Kinoshita, Kozo
    Iwasaki, Hiroshi
    Japanese Journal of Applied Physics, Part 1: Regular Papers and Short Notes and Review Papers, 1998, 37 (10): : 5839 - 5841
  • [39] Solution of the knapsack problem by deoxyribonucleic acid computing
    Aoi, Y
    Yoshinobu, T
    Tanizawa, K
    Kinoshita, K
    Iwasaki, H
    JAPANESE JOURNAL OF APPLIED PHYSICS PART 1-REGULAR PAPERS SHORT NOTES & REVIEW PAPERS, 1998, 37 (10): : 5839 - 5841
  • [40] A NEW ALGORITHM FOR THE SOLUTION OF THE KNAPSACK-PROBLEM
    INGEMARSSON, I
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 149 : 309 - 315
12345