The purpose of this article is to show the great interest of theuse of propagation (or pruning) techniques, inside classicalinterval Branch-and-Bound algorithms. Therefore, a propagationtechnique based on the construction of the calculus tree isentirely explained and some properties are presented without theneed of any formalism (excepted interval analysis). This approachis then validated on a real example: the optimal design of anelectrical rotating machine.