Branch-and-Bound
Variation for case where finding minimum (or maximum) of objective function
Example: finding the minimum number of colors needed to color graph.
Idea: improve performance of algorithm by pruning search when know that can’t possibly be going down the correct path.