Branch and Bound

A general algorithmic technique for solving optimization problems that divide the problem into a set of smaller subproblems and then prunes the search space by bounding the solution value of each subproblem.