𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel algorithm for the knapsack problem using a generation and searching technique

✍ Scribed by Henry Ker-Chang Chang; Jonathan Jen-Rong Chen; Shyong-Jian Shyu

Book ID
107919367
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
595 KB
Volume
20
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