A systematic approach that divides the search space of feasible solutions into smaller subspaces, effectively pruning branches that cannot yield better integer solutions, in order to find the optimal integer solution efficiently.

Branch and bound algorithms are used to find the optimal solution for combinatory, discrete, and general mathematical optimization problems. In general, given an NP-Hard problem, a branch and bound algorithm explores the entire search space of possible solutions and provides an optimal solution.