The Travelling Salesman Problem (TSP)
Given G, a directed graph with weighted edges, where vertices represent cities, and weights on edges connecting cities give the distance/cost of traveling between those cities.
Problem: Find the minimum cost cycle that visits all the cities in the graph exactly once before returning to the starting point.
The number of possible paths is exponential; can we do better than exhaustively trying all paths?