GPU implementation of the branch and bound method for knapsack problems

Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012

Volumn , Issue , 2012, Pages 1769-1777

  Lalami, Mohamed Esseghir ^a   El Baz, Didier ^a  

^a UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

branch and bound method; combinatorial optimization; CUDA; GPU computing; hybrid computing; knapsack problems

Indexed keywords

BRANCH AND BOUNDS; COMPUTATIONAL RESULTS; CUDA; EFFICIENT IMPLEMENTATION; GPU COMPUTING; GPU IMPLEMENTATION; HYBRID COMPUTING; KNAPSACK PROBLEMS;

BRANCH AND BOUND METHOD; DISTRIBUTED PARAMETER NETWORKS; LINEAR PROGRAMMING; PROGRAM PROCESSORS;

COMBINATORIAL OPTIMIZATION;

EID: 84867427229     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2012.219     Document Type: Conference Paper

References (21)

1. V. Boyer, D. El Baz, and M. Elkihel, "Heuristics for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, vol. 199, issue 3, pp. 658-664, 2009.
2. B. L. Dietrich and L. F. Escudero, "More coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds," IBM T.J. Watson Research Center, vol. RC-14389,Yorktown Heights (NY), 1989.
3. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Springer, 2004.
4. S. Martello and P. Toth, Knapsack Problems - Algorithms and Computer Implementations. Wiley & Sons, 1990.
5. D. El Baz and M. Elkihel, "Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem," Journal of Parallel and Distributed Computing, vol. 65, pp. 74-84, 2005.
6. D. C. Lou and C. C. Chang, "A parallel two-list algorithm for the knapsack problem," Parallel Computing, vol. 22, pp. 1985-1996, 1997.
7. T. E. Gerash and P. Y. Wang, "A survey of parallel algorithms for one-dimensional integer knapsack problems," INFOR, vol. 32(3), pp. 163-186, 1993.
8. G. A. P. Kindervater and H. W. J. M. Trienekens, "An introduction to parallelism in combinatorial optimization," Parallel Computers and Computations, vol. 33, pp. 65-81, 1988.
9. J. Lin and J. A. Storer, "Processor-efficient algorithms for the knapsack problem," Journal of Parallel and Distributed Computing, vol. 13(3), pp. 332-337, 1991.
10. D. Ulm, "Dynamic programming implementations on SIMD machines - 0/1 knapsack problem," M.S. Project, George Mason University, 1991.
11. V. Boyer, D. El Baz, and M. Elkihel, "Solving knapsack problems on gpu," Computers and Operations Research, vol. 39, pp. 42-47, 2012.
12. -, "Dense dynamic programming on multi gpu," in Proceedings of the 19th International Conference on Parallel Distributed and networked-based Processing (PDP 2011), 2011, pp. 545-551, in Ayia Napa (Cyprus).
13. A. Boukedjar, M. Lalami, and D. El Baz, "Parallel branch and bound on a cpu-gpu system," in Proceedings of the 20th International Conference on Parallel, Distributed and network-based Processing (PDP 2012), 2012, pp. 392-398, in Garching (Germany).
14. M. Lalami, V. Boyer, and D. El Baz, "Efficient implementation of the simplex method on a cpu-gpu system," in Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium and Workshops (IPDPSW 2011), 2011, in Anchorage (USA).
15. M. Lalami, D. El Baz, and V. Boyer, "Multi gpu implementation of the simplex algorithm," in Proceedings of the 13th IEEE International Conference on High Performance Computing and Communications (HPCC 2011), 2011, in Banff (Canada).
16. T. Van Luong, N. Melab, and E. G. Talbi, "Large neighborhood local search optimization on graphics processing units," in Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium and Workshops (IPDPSW 2010), 2010, in Atlanta (USA).
17. B. Gendron and C. T. G., "Parallel branch-and-bound algorithms: Survey and synthesis," Operation Research, vol. 42, pp. 1042-1066, 1994.
18. G. B. Dantzig, "Discrete variable extremum problems," Operations Research, vol. 5, pp. 266-277, 1957.
19. NVIDIA, "Cuda 3.2 programming guide," http://developer. download.nvidia.com/compute/cuda/3-2/toolkit/docs/CUDA-C-Programming-Guide.pdf, 2011.
20. M. Harris, "Optimizing parallel reduction in cuda," NVIDIA Developer Technology report, 2007.
21. http://www.laas.fr/laas09/CDA/23-31300-Knapsack-problems.php, "Knapsack problems benchmark."