An algorithm design paradigm for solving combinatorial optimization problems, which systematically enumerates candidate solutions by means of state space search.

"The branch and bound method is used to solve the traveling salesman problem by dividing it into smaller problems and exploring the most promising solutions first."