Branch and Bound

Natural & Formal Sciences Dictionary
A general optimization technique that systematically explores a search space by branching into subproblems and using computed bounds on the best possible solution within each branch to prune regions that cannot contain an optimal solution.