Parallel branch and bound on a CPU-GPU system

Proceedings - 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2012

Volumn , Issue , 2012, Pages 392-398

  Boukedjar, Abdelamine ^a,b   Lalami, Mohamed Esseghir ^a,b   El Baz, Didier ^a,b  

^a LAAS CNRS   (France)

^b UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUNDS; COMPUTATIONAL RESULTS; HYBRID IMPLEMENTATION; KNAPSACK PROBLEMS;

INTEGER PROGRAMMING;

LINEAR PROGRAMMING;

EID: 84862132747     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDP.2012.23     Document Type: Conference Paper

References (19)

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