Given a complete graph with weights on the edges, find a cycle of least total weight that visits each vertex exactly once.
Decision Problem:
TSP = G is a complete graph with weights on edges that contains a cycle of total weight visiting each vertex exactly once}