The Traveling Salesman Problem is one of the most well known problems in operations research, computer science, and mathematics. The basic idea is basically trying to find the shortest cycle in a network such that all the nodes are visited and the minimum total distance is traveled. A more "technical" definition follows (Golden, Bodin, Doyle, Stewart, 1980):