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

Adaptive parallel algorithms for integral knapsack problems

โœ Scribed by Shang-Hua Teng

Book ID
108016299
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
755 KB
Volume
8
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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