Definition
Branch and Bound
Restricts a systematic search of all solutions, based on divide and conquer, using methods that provide lower and upper bounds, and determines and optimal solutiuon.
Examples: Dynamic programming, approximation, heuristic methods