Voici les éléments 1-3 de 3
Parallel GPU-Accelerated Metaheuristics
(CRC Press, Taylor & Francis Group, 2013)
P2P B&B and GA for the Flow-Shop Scheduling Problem
Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm (B&B) requires a huge amount of computational resources. The efficiency of such algorithm can be improved by its hybridization ...
Reducing Thread Divergence in GPU-Based B&B Applied to the Flow-Shop Problem
(Springer Berlin Heidelberg, 2012)
In this paper,we propose a pioneering work on designing and programming B&B algorithms on GPU. To the best of our knowledge, no contribution has been proposed to raise such challenge. We focus on the parallel evaluation ...