𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel algorithm for the integer knapsack problem

✍ Scribed by D. Morales; J.L. Roda; C. Rodríguez; F. Almeida; F. García

Book ID
119977111
Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
483 KB
Volume
8
Category
Article
ISSN
1040-3108

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