An efficient parallel algorithm for solving the Knapsack problem on hypercubes

被引：10
|
作者：
Goldman, A [1 ]
Trystram, D [1 ]
机构：
[1] IMAG, ID, F-38330 Montbonnot St Martin, France
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 2004年 / 64卷 / 11期
关键词：
hypercube; Knapsack problem; irregular mesh; scheduling;
D O I：
10.1016/j.jpdc.2002.10.001
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present in this paper an efficient algorithm for solving the integral Knapsack problem on hypercube. The main idea is to represent the computations of the dynamic programming formulation as a precedence graph (which has the structure of an irregular mesh). Then, we propose a time optimal scheduling algorithm for computing the irregular meshes on hypercube. (C) 2004 Elsevier Inc. All rights reserved.
引用
收藏
页码：1213 / 1222
页数：10
相关论文
共 50 条
  • [21] An efficient algorithm for the Knapsack Sharing Problem
    Hifi, M
    Sadfi, S
    Sbihi, A
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2002, 23 (01) : 27 - 45
  • [22] Approximating the orthogonal knapsack problem for hypercubes
    Harren, Rolf
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 238 - 249
  • [23] An Efficient Algorithm for the Knapsack Sharing Problem
    Mhand Hifi
    Slim Sadfi
    Abdelkader Sbihi
    Computational Optimization and Applications, 2002, 23 : 27 - 45
  • [24] An efficient algorithm for the collapsing knapsack problem
    Wu Jigang
    Srikanthan, Thambipillai
    INFORMATION SCIENCES, 2006, 176 (12) : 1739 - 1751
  • [25] 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
  • [26] Parallel genetic algorithm for multi knapsack problem
    Qi, T
    Zhou, SJ
    Chang, GJ
    CCECE 2003: CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-3, PROCEEDINGS: TOWARD A CARING AND HUMANE TECHNOLOGY, 2003, : 1115 - 1118
  • [27] An Optimal Parallel Algorithm for the Knapsack Problem Based on EREW
    李肯立
    蒋盛益
    王卉
    李庆华
    Journal of Southwest Jiaotong University, 2003, (02) : 131 - 137
  • [28] A parallel branch and bound algorithm for collapsing knapsack problem
    Chen, G.-L.
    Wu, M.
    Gu, J.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2001, 38 (06): : 741 - 745
  • [29] Parallel two-list algorithm for the knapsack problem
    Natl Chung Cheng Univ, Chiayi, Taiwan
    Parallel Comput, 14 (1985-1996):
  • [30] A parallel two-list algorithm for the knapsack problem
    Lou, DC
    Chang, CC
    PARALLEL COMPUTING, 1997, 22 (14) : 1985 - 1996
12345