.png){kind=icon}
Return
An efficient parallel algorithm for solving the Knapsack problem on hypercubes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2002.10.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
hypercube
Knapsack problem
irregular mesh
scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more