ABSTRACT
This article proposes a study of load balancing for Branch-and-Bound algorithms. Concretely, sequential and parallel generic skeletons to implement this algorithmic technique are presented. To accomplish the work the CALL tool is used. CALL allows to annotate the code by hand at the special points with a complexity function. Also, some preliminary computational results are presented.
