Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 2/2]
Tim Roughgarden Lectures · 11:57
The 2-opt local-search heuristic, started from the nearest-neighbor perimeter tour of cost 29, improves a 5-vertex TSP instance down to a locally optimal tour of cost 24 and then stops—even though a different tour of...