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 条
  • [1] A successive approximation algorithm for the multiple knapsack problem
    Zhenbo Wang
    Wenxun Xing
    [J]. Journal of Combinatorial Optimization, 2009, 17 : 347 - 366
  • [2] A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem
    Khutoretskii A.B.
    Bredikhin S.V.
    Zamyatin A.A.
    [J]. Khutoretskii, A.B. (hab@dus.nsc.ru), 2018, Pleiades journals (12) : 264 - 277
  • [3] Parameterized Approximation Scheme for the Multiple Knapsack Problem
    Jansen, Klaus
    [J]. PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 665 - 674
  • [4] A Fast Approximation Scheme for the Multiple Knapsack Problem
    Jansen, Klaus
    [J]. SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 313 - 324
  • [5] PARAMETERIZED APPROXIMATION SCHEME FOR THE MULTIPLE KNAPSACK PROBLEM
    Jansen, Klaus
    [J]. SIAM JOURNAL ON COMPUTING, 2009, 39 (04) : 1392 - 1412
  • [6] Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
    M. Dawande
    J. Kalagnanam
    P. Keskinocak
    F.S. Salman
    R. Ravi
    [J]. Journal of Combinatorial Optimization, 2000, 4 : 171 - 186
  • [7] A polynomial time approximation scheme for the multiple knapsack problem
    Chekuri, C
    Khanna, S
    [J]. SIAM JOURNAL ON COMPUTING, 2006, 35 (03) : 713 - 728
  • [8] Approximation algorithms for the multiple knapsack problem with assignment restrictions
    Dawande, M
    Kalagnanam, J
    Keskinocak, P
    Salman, FS
    Ravi, R
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000, 4 (02) : 171 - 186
  • [9] Evolutionary game algorithm for multiple knapsack problem
    Jun, Y
    Liu, XD
    Lu, H
    [J]. IEEE/WIC INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY, PROCEEDINGS, 2003, : 424 - 427
  • [10] A genetic algorithm for the quadratic multiple knapsack problem
    Sarac, Tugba
    Sipahioglu, Aydin
    [J]. ADVANCES IN BRAIN, VISION, AND ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, 4729 : 490 - +
12345