Home Bookmarks Papers Blog

TSP - formal defintion

We are given a complete undirected graph G that has a nonnegative integer cost (weight) associated with each edge, and we must find a hamiltonian cycle (a tour that passes through all the vertices) of G with minimum cost.