A successive approximation algorithm for the multiple knapsack problem

被引：6

作者：

Wang, Zhenbo ^{[1
]}

Xing, Wenxun ^{[1
]}

机构：

[1] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2009年 / 17卷 / 04期

关键词：

Multiple knapsack problem; Approximation algorithm; Worst-case analysis; SUM;

D O I：

10.1007/s10878-007-9116-y

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

It is well-known that the multiple knapsack problem is NP-hard, and does not admit an FPTAS even for the case of two identical knapsacks. Whereas the 0-1 knapsack problem with only one knapsack has been intensively studied, and some effective exact or approximation algorithms exist. A natural approach for the multiple knapsack problem is to pack the knapsacks successively by using an effective algorithm for the 0-1 knapsack problem. This paper considers such an approximation algorithm that packs the knapsacks in the nondecreasing order of their capacities. We analyze this algorithm for 2 and 3 knapsack problems by the worst-case analysis method and give all their error bounds.

引用

页码：347 / 366

页数：20

共 50 条

[21] Approximation of the Quadratic Knapsack Problem
Taylor, Richard
OPERATIONS RESEARCH LETTERS, 2016, 44 (04) : 495 - 497
[22] Approximation of the Quadratic Knapsack Problem
Pferschy, Ulrich
Schauer, Joachim
INFORMS JOURNAL ON COMPUTING, 2016, 28 (02) : 308 - 318
[23] The fully polynomial approximation algorithm for the 0-1 knapsack problem
Liu, YJ
THEORY OF COMPUTING SYSTEMS, 2002, 35 (05) : 559 - 564
[24] The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem
Yingjie Liu
Theory of Computing Systems, 2002, 35 : 559 - 564
[25] Semi-definite relaxation algorithm of multiple knapsack problem
Chen F.
Yao E.
Applied Mathematics-A Journal of Chinese Universities, 2002, 17 (2) : 241 - 250
[26] A Lagrangean based solution algorithm for the multiple knapsack problem with setups
Amiri, Ali
Barkhi, Reza
COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 153
[27] A generalisation of an algorithm solving the fuzzy multiple choice knapsack problem
Kuchta, D
FUZZY SETS AND SYSTEMS, 2002, 127 (02) : 131 - 140
[28] A MINIMAL ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK-PROBLEM
PISINGER, D
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 83 (02) : 394 - 410
[29] Hybrid Ant Colony Optimization Algorithm for Multiple Knapsack Problem
Fidanova, Stefka
2020 5TH IEEE INTERNATIONAL CONFERENCE ON RECENT ADVANCES AND INNOVATIONS IN ENGINEERING (IEEE - ICRAIE-2020), 2020,
[30] A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 298 (01) : 89 - 98

← 1 2 3 4 5 →