Search results
We did not find results for: traveling salesman.
Check spelling or type a new query.
We did not find results for: traveling salesman.
Check spelling or type a new query.
The travelling salesman problem, also known as the travelling salesperson problem (TSP), asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and opera... Wikipedia