@@ -108,6+108,7 @@ Take this graph for instance, generated by the Christofides Algorithm.

+
If you notice the edge between (273, 269) and (334,510) and the edge between (263, 392) and (510, 143). They cross each other and it would probably be a better solution if they connected differently.
This method of improving a candidate solution created by a heuristic is called local search.