Computer Scientists Find New Shortcuts for Infamous Traveling Salesman Problem | Wired Science | Wired.com | Big Data | Scoop.it
The traveling salesman problem asks: Given a collection of cities connected by highways, what is the shortest route that visits every city and returns to the starting place?