The input is an undirected graph G = (V, E) along with edge lengths l. The graph is complete.
Given a budget b > 0, find a tour that visits each vertex exactly once and has length ≤ b, or determine that no tour exists. Or… Find a tour that visits each vertex in G once and has minimum length.