The Travelling Salesman Problem Is it possible to compute the shortest route through a large number of stops? The task, known as the traveling salesman problem, or TSP for short, sounds simple enough.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results