stc
Travelling salesman problem
Mathematics
A salesman must visit a set of cities, in order to sell his products, starting and ending his trip to one specific city. The distance between each pair of cities is directly proportional to the traveling costs. Which is the cheapest possible route that the salesman should follow in order to visit each town once and return to his starting point? Can you help the salesman complete the task?
stc