Comments on parallel algorithms for the knapsack problem

Parallel Computing

Volumn 28, Issue 10, 2002, Pages 1501-1505

  Sanches, Carlos Alberto Alonso ^a   Soma, Nei Yoshihiro ^a   Yanasse, Horacio Hideki ^b  

^a INSTITUTO TECNOLÓGICO DE AERONÁUTICA   (Brazil)

^b INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Knapsack problem; Parallel algorithm; Shared memory multiprocessor; SIMD machine

Indexed keywords

DATA STORAGE EQUIPMENT; PARALLEL PROCESSING SYSTEMS; PERFORMANCE; PROGRAM PROCESSORS;

PERFORMANCE ANALYSIS;

PARALLEL ALGORITHMS;

EID: 0036789044     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(02)00150-3     Document Type: Article

References (9)

1. Chang H.K.-C., Chen J.J.-R., Shyu S.-J. A parallel algorithm for the knapsack problem using a generation and searching technique. Parallel Computing. 1994;233-243.
2. Cosnard M., Duprat J., Ferreira A.G. Complexity of selection in. X+Y Theoretical Computer Science. 67:1989;115-120.
3. Ferreira A.G. On space-efficient algorithms for certain NP-complete problems. Theoretical Computer Science. 120:1993;311-315.
4. Ferreira A.G., Robson J.M. Fast and scalable parallel algorithms for knapsack-like problems. Journal of Parallel and Distributed Computing. 39:1996;1-13.
5. Horowitz E., Sahni S. Computing partitions with applications to the knapsack problem. Journal of ACM. 21(2):1974;277-292.
6. Karnin E.D. A parallel algorithm for the knapsack problem. IEEE Transactions on Computers. C-33:1984;404-408.
7. Lou D.C., Chang C.C. A parallel two-list algorithm for the knapsack problem. Parallel Computing. 1997;1985-1996.
8. C.A.A. Sanches, N.Y. Soma, H.H. Yanasse, An adaptive optimal parallel two-list algorithm for the knapsack problem, submitted to Journal of Parallel and Distributed Computing
9. n/k) space algorithms for certain NP-complete problems Theoretical Computer Science. 51:1987;221-227. Corrigendum: Theoretical Computer Science 68 (1989).