Disjunctions in numerical CSPs appear in applications such as Design, Biology or Control. Generalized solving techniques have been proposed to handle these disjunctions in a Branch&Prune fashion. However, they focus essentially on the pruning operation. In this paper, we present experimental evidences that significant performance gains can be expected by exploiting the disjunctions in the branching operation.