Branch-and-bound algorithms solve optimization problems and find the best solution also by using a search tree, eliminating the branches that will not lead to a better solution that the one currently known.

Find the best solution possible.

Branch pruning. Bound estimation.

Any number of solutions may be “valid” solutions but only a few will be optimal.

Examples: travelling salesman problem, chess engine AI.