Branch-and-bound

The branch-and-bound method is a general algorithm for solving combinatorial optimization problems by intelligently enumerating all the feasible points.

The branch refers to the process of partitioning the solution space. The bound refers to lower bounds that are used to construct a proof of optimality.

One of the important applications of branch-and-bound is the ILP (Integer Linear Programming) problem.