Improved Dynamic Programming Algorithms for the 0-1 Knapsack Problem

被引：0
|
作者：
Meng, Xiaohua [1 ,2 ]
Zhu, Yue-an [2 ]
Wu, Xiaoming [3 ]
机构：
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510632, Guangdong, Peoples R China
[2] Jinan Univ, Sch Informat Sci & Technol, Guangzhou 510632, Guangdong, Peoples R China
[3] South China Univ Technol, Sch Biol Sci & Engn, Guangzhou, Guangdong, Peoples R China
来源：
PROCEEDINGS OF 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (ICCSIT 2010), VOL 8 | 2010年
关键词：
0-1 knapsack problem; dynamic programming; divided-and-conquer; algorithm complexity;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Based on the classic dynamic programming solution to solve the 0-1 knapsack problem, we give an improved algorithm called IKP. Further, in order to decrease the space complexity of IKP, we combine divided-and-conquered strategy with IKP to obtain a new algorithm DKP. Our Analysis shows that DKP has a great advantage over IKP in running time and resource cost. Moreover, DKP has a better time complexity than some known algorithms for the 0-1 knapsack problem, and it has high parallel, in which way DKP can relief the tension of memory cost.
引用
收藏
页码：19 / 22
页数：4
相关论文
共 50 条
  • [1] Dynamic programming based algorithms for the discounted {0-1} knapsack problem
    Rong, Aiying
    Figueira, Jose Rui
    Klamroth, Kathrin
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (12) : 6921 - 6933
  • [2] Dynamic programming and strong bounds for the 0-1 knapsack problem
    Martello, S
    Pisinger, D
    Toth, P
    [J]. MANAGEMENT SCIENCE, 1999, 45 (03) : 414 - 424
  • [3] Linear programming for the 0-1 quadratic knapsack problem
    Billionnet, A
    Calmels, F
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 92 (02) : 310 - 325
  • [4] A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
    Balev, Stefan
    Yanev, Nicola
    Freville, Arnaud
    Andonov, Rumen
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 186 (01) : 63 - 76
  • [5] Improved results on the 0-1 multidimensional knapsack problem
    Vasquez, M
    Vimont, Y
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (01) : 70 - 81
  • [6] An improved monkey algorithm for a 0-1 knapsack problem
    Zhou, Yongquan
    Chen, Xin
    Zhou, Guo
    [J]. APPLIED SOFT COMPUTING, 2016, 38 : 817 - 830
  • [7] Greedy backtracking based local dynamic programming for complete 0-1 knapsack problem
    He K.
    Ren S.
    Guo Z.
    Qiu T.
    [J]. Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2024, 52 (02): : 16 - 21
  • [8] Evolutionary and heuristic algorithms for multiobjective 0-1 knapsack problem
    Kumar, Rajeev
    Singh, R. K.
    Singhal, A. P.
    Bhartia, Atul
    [J]. APPLICATIONS OF SOFT COMPUTING: RECENT TRENDS, 2006, : 331 - +
  • [9] New trends in exact algorithms for the 0-1 knapsack problem
    Martello, S
    Pisinger, D
    Toth, P
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (02) : 325 - 332
  • [10] Research on genetic algorithms for the discounted {0-1} knapsack problem
    He Y.-C.
    Wang X.-Z.
    Li W.-B.
    Zhang X.-L.
    Chen Y.-Y.
    [J]. 2016, Science Press (39): : 2614 - 2630
12345