TravelingSalesmanProblem

The has name::traveling salesman problem (has acronym::TSP) asks has short description::what is the shortest path visiting a number of cities starting and ending in the same particular city.