Branch and bound is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as general real-valued problems

The algorithm depends on the efficient estimation of the lower and upper bounds of a region/branch of the search space and approaches exhaustive enumeration as the size of the region tends to zero.

Data structure problems
234 Traveling salesman problem
Travelling salesman problem solve to find the shortest possible route that visits each city exactly once and returns to the origin city.