Branch & Bound is a..

Solution strategy for integer programming problems where the idea is to split the feasible region into smaller regions and solve a relaxed problem in each subproblem.