Heuristic optimization
= Heuristic optimization
<Heuristic optimization> seeks useful feasible solutions without necessarily providing a universal <approximation ratio> or a polynomial worst-case guarantee. Examples are <local search>, <simulated annealing> and <tabu search>. A claimed <approximation algorithm> needs a separate proved performance guarantee.