𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new algorithm for the Integer Knapsack Problem and its parallelization

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

Book ID
112783647
Publisher
Springer-Verlag
Year
1995
Tongue
English
Weight
588 KB
Volume
3
Category
Article
ISSN
1134-5764

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

Fast and Scalable Parallel Algorithms fo
Fast and Scalable Parallel Algorithms for Knapsack-like Problems
✍ Afonso Ferreira; John Michael Robson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 403 KB

We present two new algorithms for searching in sorted X ؉ Y ؉ R ؉ S, one based on heaps and the other on sampling. Each of the algorithms runs in time O(n 2 log n) (n being the size of the sorted arrays X, Y, R, and S). Hence in each case, by constructing arrays of size n ‫؍‬ O(2 s/4 ), we obtain a