.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
hypercube
Knapsack problem
irregular mesh
scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容