Traveling Salesman Problem and Digital Art

Traveling Salesman Problem and Digital Art
Share

 Traveling salesman problem: Wikipedia: “The travelling salesman 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 operations research and theoretical computer science.”   In the mathematics literature, it appears that the first mention of the TSP was…

Share
Read More