๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal parallel algorithms for the knapsack problem without memory conflicts

โœ Scribed by Ken-Li Li; Ren-Fa Li; Qing-Hua Li

Publisher
Springer
Year
2004
Tongue
English
Weight
844 KB
Volume
19
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Comments on parallel algorithms for the
Comments on parallel algorithms for the knapsack problem
โœ Carlos Alberto Alonso Sanches; Nei Yoshihiro Soma; Horacio Hideki Yanasse ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 65 KB

Chang et al. [Parallel Comput. (1994) 233] introduced a parallel algorithm based on a shared memory SIMD architecture for the generation phase of the classic Horowitz and Sahni [J. ACM 21(2) (1974) 277] two-list serial algorithm for the knapsack problem. They claimed that their parallel generation p

A parallel two-list algorithm for the kn
A parallel two-list algorithm for the knapsack problem
โœ Der-Chyuan Lou; Chin-Chen Chang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 695 KB

An n-element knapsack problem has 2" possible solutions to search over, so a task which can be accomplished in 2" trials if an exhaustive search is used. Due to the exponential time in solving the knapsack problem, the problem is considered to be very hard. In the past decade, much effort has been d