Home / Computer science / Traveling salesman problem (TSP)
Intuition
Given pair-wise distances between cities,
find the shortest tour that visits each city exactly once
and returns back to the starting point.
Home / Computer science / Traveling salesman problem (TSP)
Given pair-wise distances between cities,
find the shortest tour that visits each city exactly once
and returns back to the starting point.