Parcourir par sujet "Parallel B&B"
Voici les éléments 1-1 de 1
In : Thèses de Doctorat, (Université de Béjaïa, 2012-06-07)Solving to optimality large instances of combinatorial optimization problems using Branch and Bound (B&B) algorithms requires a huge amount of computing resources. Nowadays, such power is provided by large scale environments such as computational grids. However, grids induce new challenges: scalability, heterogeneity, ...