12 citations · 28 across the 7 of their papers we have counts for
1 paper · 2 filters
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…