主观题：K-flip algorithm for TSP

**Traveling salesman problem** (TSP): Given a complete graph $$ G=(V, E)$$, with edge costs.  Find the shortest simple cycle that visits all vertices.

TSP is a famous NP-hard problem typically solved using various heuristics.  Now you are supposed to design a $$k$$-flip local search algorithm for TSP.







答案：