An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem

European Journal of Operational Research

Volumn 176, Issue 2, 2007, Pages 870-879

  Sanches, C A A ^a   Soma, N Y ^a   Yanasse, H H ^b  

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

^b INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Knapsack problem; Parallel algorithms; PRAM machines; Subset sum problem

Indexed keywords

KNAPSACK PROBLEM; PRAM MACHINES; SCALABLE PARALLELIZATION; SUBSET SUM PROBLEM;

COMPUTATIONAL COMPLEXITY; MULTIPROCESSING SYSTEMS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; SET THEORY;

PARALLEL ALGORITHMS;

EID: 33749566608     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.09.026     Document Type: Article

References (19)

1. Akl S.G. The Design and Analysis of Parallel Algorithms (1989), Prentice-Hall, Englewood Cliffs, NJ
2. Chang H.K.-C., Chen J.J.-R., and Shyu S.-J. A parallel algorithm for the Knapsack problem using a generation and searching technique. Parallel Computing (1994) 233-243
3. Cole R. Parallel merge sort. SIAM Journal on Computing 17 (1988) 770-785
4. Dantzig G.B. Discrete variable extremum problems. Operational Research 5 (1957) 266-277
5. n/2) for the Knapsack problem. IEEE Transactions on Computers 40 2 (1991) 221-225
6. Ferreira A.G., and Robson J.M. Fast and scalable parallel algorithms for Knapsack-like problems. Journal of Parallel and Distributed Computing 39 (1996) 1-13
7. Garey R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, New York
8. Horowitz E., and Sahni S. Computing partitions with applications to the Knapsack problem. Journal of the ACM (1974) 277-292
9. Karnin E.D. A parallel algorithm for the Knapsack problem. IEEE Transactions on Computers C-33 (1984) 404-408
10. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer
11. Lin J., and Storer J. Processor efficient hypercube algorithm for the Knapsack problem. Journal of Parallel and Distributed Computing 3 (1991) 332-337
12. Lou D.C., and Chang C.C. A parallel two-list algorithm for the Knapsack problem. Parallel Computing (1997) 1985-1996
13. Nassimi D., and Sahni S. Data broadcasting in SIMD computers. IEEE Transactions on Computers C-30 (1981) 101-107
14. Nassimi D., and Sahni S. Parallel permutation and sorting algorithms and a new generalized connection network. Journal of the ACM (1982) 642-667
15. Teng S. Adaptive parallel algorithms for integral Knapsack problems. Journal of Parallel and Distributed Computing 8 (1990) 400-406
16. Sanches C.A.A., Soma N.Y., and Yanasse H.H. Comments on parallel algorithms for the Knapsack problem. Parallel Computing 28 (2002) 1501-1505
17. n/4) algorithm for certain NP-complete problems. SIAM Journal on Computing 10 3 (1981) 456-464
18. Soma N.Y., and Toth P. An exact algorithm for the subset sum problem. European Journal of Operational Research 136 1 (2002) 57-66
19. Stinson D.R. Criptography: Theory and Practice (1995), CRC Press, Boston