Branching Strategy Introduction
A branching strategy is an integral part of any branch and bound algorithm. We select a variable and split its range into several smaller parts. By doing this, we reduce the problem size as it is now divided into a few several smaller problems.
Therefore, the relaxation of each problem is more accurate and the solution from the local nonlinear solver is more likely to be close to the global optimum.