Optimal parallel algorithm for the knapsack problem

被引:0
|
作者
Li, Qing-Hua [1 ,2 ]
Li, Ken-Li [1 ,2 ]
Jiang, Sheng-Yi [1 ,2 ]
Zhang, Wei [1 ,2 ]
机构
[1] Natl. High Performance Comp. Ctr., Wuhan 430074, China
[2] Sch. of Comp. Sci. and Technol., Huazhong Univ. of Sci. and Technol., Wuhan 430074, China
来源
Ruan Jian Xue Bao/Journal of Software | 2003年 / 14卷 / 05期
关键词
Knapsack problem - Method of divide and conquer - Shared memory - Two list algorithms;
D O I
暂无
中图分类号
学科分类号
摘要
引用
下载
收藏
页码:891 / 896
相关论文
共 50 条
  • [31] PARALLEL GENETIC ALGORITHM SOLVING 0/1 KNAPSACK PROBLEM RUNNING ON THE GPU
    Pospichal, Petr
    Schwarz, Josef
    Jaros, Jiri
    16TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING MENDEL 2010, 2010, : 64 - 70
  • [32] A parallel Tabu Search algorithm for the 0-1 Multidimensional Knapsack Problem
    Niar, S
    Freville, A
    11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, : 512 - 516
  • [33] ON PARALLEL COMPUTATION FOR THE KNAPSACK PROBLEM.
    Chi Chih Yao, Andrew
    1600, (29):
  • [34] A Parallel Nash Genetic Algorithm for the 3D Orthogonal Knapsack Problem
    Soto, Daniel
    Soto, Wilson
    Pinzon, Yoan
    INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2013, 4 (03): : 2 - 10
  • [35] A Parallel Solution for The 0-1 Knapsack Problem Using Firefly Algorithm
    Hoseini, Farnaz
    Shahbahrami, Asadollah
    Hajarian, Mohammad
    2016 1ST CONFERENCE ON SWARM INTELLIGENCE AND EVOLUTIONARY COMPUTATION (CSIEC 2016), 2016, : 25 - 30
  • [36] Comments on parallel algorithms for the knapsack problem
    Sanches, CAA
    Soma, NY
    Yanasse, HH
    PARALLEL COMPUTING, 2002, 28 (10) : 1501 - 1505
  • [37] ON PARALLEL COMPUTATION FOR THE KNAPSACK-PROBLEM
    YAO, ACC
    JOURNAL OF THE ACM, 1982, 29 (03) : 898 - 903
  • [38] A cost-optimal parallel algorithm for the 0-1 knapsack problem and its performance on multicore CPU and GPU implementations
    Li, Kenli
    Liu, Jing
    Wan, Lanjun
    Yin, Shu
    Li, Keqin
    PARALLEL COMPUTING, 2015, 43 : 27 - 42
  • [39] Solving the 0/1 knapsack problem with improved pseudo-parallel genetic algorithm
    Chen, Yiming
    Li, Guangjun
    Zeng, Xiaoqing
    ADVANCES IN BUSINESS INTELLIGENCE AND FINANCIAL ENGINEERING, 2008, 5 : 329 - 333
  • [40] On Using Gray Codes to Improve the Efficiency of the Parallel Exhaustive Search Algorithm for the Knapsack Problem
    Natalia, Kupriyashina
    Mikhail, Kupriyashin
    Georgii, Borzunov
    PROCEEDINGS OF THE 2019 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (EICONRUS), 2019, : 1821 - 1825