What is the Traveling Salesperson Problem (TSP)?

What is the Traveling Salesperson Problem (TSP)?

Approach: Define the problem of finding the shortest cycle visiting all nodes.

Given a list of cities and distances between each pair, the problem is to find the shortest possible route that visits each city exactly once and returns to the origin city.

Follow-up: How can dynamic programming solve this for small n?

Key concepts: hamiltonian cycle, combinatorial optimization, np-hard.