1 paper
Uri Patish, Shimon Ullman
We study the task of finding good local optima in combinatorial optimization problems. Although combinatorial optimization is NP-hard in general, locally optimal solutions are freq…