Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem

Journal of Parallel and Distributed Computing

Volumn 65, Issue 1, 2005, Pages 74-84

  El Baz, D ^a   Elkihel, M ^a  

^a LAAS CNRS   (France)

Author keywords

0 1 Knapsack problem; Dominance technique; Dynamic programming; Load balancing; Parallel computing

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DYNAMIC PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SET THEORY; SUPERCOMPUTERS;

0-1 KANPSACK PROBLEM; DOMINANCE TECHNIQUE; LOAD BALANCING METHODS; PAARLLEL DYNAMIC PROGRAMMING ALGORITHM;

PARALLEL ALGORITHMS;

EID: 11444259722     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.10.004     Document Type: Article

References (27)

1. J.H. Ahrens, G. Finke, Merging and sorting applied to the zero - one knapsack problem, Oper. Res. 23 (1975) 1099-1109.
2. R. Andonov, F. Gruau, A linear systolic array for the knapsack problem, Proceedings of the International Conference on Application Specific Array Processors, vol. 23, 1991, pp. 458-472.
3. R. Andonov, P. Quinton, Efficient linear systolic array for the knapsack problem, in: L. Bougé, M. Cosnard, Y Robert, D. Trystram (Eds.), Parallel Processing: CONPAR 92 - VAPP V, vol. 634, Lecture Notes in Computer Science, Springer, Berlin, 1992, pp. 247-258.
4. H. Bouzoufi, S. Boulenouar, R. Andonov, Pavage optimal pour des dépendances de type sac à dos, Actes du Colloque RenPar'10, 1998.
5. J. Casti, M. Richardson, R. Larson, Dynamic programming and parallel computers, J. Optim. Theory Appl. 12 (1973) 423-438.
6. H.K.C. Chang, J.J.R. Chen, S.J. Shyu, A parallel algorithm for the knapsack problem using a generation and searching technique, Parallel Comput. 20 (1994) 233-243.
7. G.H. Chen, M.S. Chem, J.H. Jang, Pipeline architectures for dynamic programming algorithms, Parallel Comput. 13 (1990) 111-117.
8. M. Cosnard, A.G. Ferreira, H. Herbelin, The two list algorithm for a knapsack problem on a FPS T 20, Parallel Comput. 9 (1989) 385-388.
9. G. Cybenko, Dynamic load balancing for distributed-memory multiprocessors, J. Parallel Distributed Comput. 7 (1989) 279-301.
10. M. Elkihel, Programmation dynamique et rotation de contraintes pour les problèmes d'optimisation entière, Thèse de Doctorat, Université des Sciences et Techniques de Lille, 1984.
11. M. Elkihel, D. El Baz, An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem, in: G.R. Joubert, A. Murli, F.J. Peters, M. Vanneschi (Eds.), Parallel Computing Advances and Current Issues, Imperial College Press, London, 2002, pp. 298-305.
12. D. Fayard, G. Plateau, Resolution of the 0-1 knapsack problem: comparison of methods, Math. Programming 8 (1975) 272-307.
13. T.E. Gerash, P.Y. Wang, A survey of parallel algorithms for onedimensional integer knapsack problems, INFOR 32 (1994) 163-186.
14. E. Horowitz, S. Sahni, Computing partitions with application to the knapsack problems, J. Assoc. Comput. Mach. 21 (1974) 275-292.
15. G. Kindervater, J.K. Lenstra, An introduction to parallelism in combinatorial optimization, Discrete Appl. Math. 14 (1986) 135-156.
16. G. Kohring, Dynamic load balancing for parallelized particle simulations on MIMD computers, Parallel Comput, 21 (1995) 638-693.
17. M. Lauriere, An algorithm for the 0-1 knapsack problem, Math. Programming 14 (1978) 1-10.
18. D.C. Lou, C.C. Chang, A parallel two list algorithm for the knapsack problem, Parallel Comput. 22 (1997) 1985-1996.
19. S. Martello, P. Toth, An upper bound for the zero one knapsack problem and a branch and bound algorithm, European J. Oper. Res. 1 (1977) 169-175.
20. S. Martello, P. Toth, Algorithm for the solution of the 0-1 single knapsack problem, Computing 21 (1978) 81-86.
21. S. Martello, D. Pisinger, P. Toth, Dynamic programming and strong bounds for the 0-1 knapsack problem, Management Sci. 45 (1999) 414-424.
22. L. Oliker, R. Biswas, PLUM: parallel load balancing for adaptive unstructured meshes, S. Parallel Distributed Comput. 52 (1998) 150-157.
23. U. Pferschy, Dynamic programming revisited: improving knapsack algorithms, Computing 63 (1999) 419-430.
24. D. Pisinger, A minimal algorithm for the 0-1 knapsack problem, Oper. Res. 45 (1997) 758-767.
25. D. Pisinger, P. Toth, Knapsack problems, in: D.Z. Du, P. Pardalos (Eds.), Handbook of Combinatorial Optimization, Kluwer, Dordrecht, 1998, pp. 1-89.
26. G. Plateau, M. Elkihel, A hybrid method for the 0-1 knapsack problem, Methods Oper. Res. 49 (1985) 277-293.
27. P. Toth, Dynamic programming algorithms for the zero-one knapsack problem, Computing 25 (1980) 29-45.