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 条

[21] Exact Parallel Algorithm for the Knapsack Sharing Problem
Mhalla, Hedi
Laalaoui, Yacine
INTERNATIONAL CONFERENCE ON ELECTRICAL, COMPUTER AND ENERGY TECHNOLOGIES (ICECET 2021), 2021, : 2236 - 2240
[22] Exact solution of a class of nonlinear knapsack problems
Elhedhli, S
OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 615 - 624
[23] EXACT ALGORITHMS FOR THE SETUP KNAPSACK-PROBLEM
CHAJAKIS, ED
GUIGNARD, M
INFOR, 1994, 32 (03) : 124 - 142
[24] Some exact algorithms for the knapsack sharing problem
Department of Computer Science, National Defense Academy, Yokosuka, Kanagawa 239, Japan
Eur J Oper Res, 1 (177-183):
[25] Exact methods for discrete G-robust interdiction problems with an application to the bilevel knapsack problem
Beck, Yasmine
Ljubic, Ivana
Schmidt, Martin
MATHEMATICAL PROGRAMMING COMPUTATION, 2023, 15 (04) : 733 - 782
[26] DISTRIBUTIONALLY ROBUST STOCHASTIC KNAPSACK PROBLEM
Cheng, Jianqiang
Delage, Erick
Lisser, Abdel
SIAM JOURNAL ON OPTIMIZATION, 2014, 24 (03) : 1485 - 1506
[27] Complexity Results and Exact Algorithms for Robust Knapsack Problems
Fabrice Talla Nobibon
Roel Leus
Journal of Optimization Theory and Applications, 2014, 161 : 533 - 552
[28] Complexity Results and Exact Algorithms for Robust Knapsack Problems
Nobibon, Fabrice Talla
Leus, Roel
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2014, 161 (02) : 533 - 552
[29] AN EXACT SEARCH FOR THE SOLUTION OF THE SURROGATE DUAL OF THE 0-1 BIDIMENSIONAL KNAPSACK-PROBLEM
FREVILLE, A
PLATEAU, G
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 68 (03) : 413 - 421
[30] The temporal knapsack problem and its solution
Bartlett, M
Frisch, AM
Hamadi, Y
Miguel, I
Tarim, SA
Unsworth, C
INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2005, 3524 : 34 - 48

← 1 2 3 4 5 →