This algorithm integrates the search capabilities of classical computing ... efficient classical optimization algorithms—such as greedy algorithms, heuristic algorithms, simulated annealing ...

local search can get stuck in local maxima, or stuck on plateaus, and so some strategy is needed to deal with such problems hill-climbing is a kind of greedy search: it always chooses the next current ...

Mathematical Background: We expect that the student is comfortable with basic mathematics at the level of a U.S. first-year college STEM student. This includes basic notions such as sets and functions ...