### General - input: a graph adjacency matrix of distances - output: the shortest tour which passes through all the cities & returns to starting node (shortest cycle that visits each vertex once) - is [[NP Hard Problems|NP Hard]] - is the optimization version of the NP Complete [[Traveling Salesman Problem (TSP)]]