Travelling salesman problem
= Travelling salesman problem
{wiki}
= Traveling salesman problem
{synonym}
Given finitely many locations and pairwise travel costs, find a cyclic visiting order minimizing the sum of its costs. For <Euclidean distance> this becomes the <Euclidean travelling salesman tour> problem.