Algorithms for NP-Hard Problems (Section 20.5: Principles of Local Search) [Part 2 of 2]
Tim Roughgarden Lectures · 24:48
Even after you know a TSP instance and its global optima, local search is still a family of design choices: neighborhood size (2-opt vs 3-opt), initialization, move selection, and extra machinery for escaping bad loca...