𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The two list algorithm for the knapsack problem on a FPS T20

✍ Scribed by M Cosnard; A.G Ferreira; H Herbelin

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
297 KB
Volume
9
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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