NP-hard: find the shortest tour visiting all cities exactly once. Nearest neighbor gives a quick heuristic; 2-opt iteratively improves by reversing route segments.