Computer Scientists Find New Shortcuts for Infamous Traveling Salesman Problem | Wired Science | Wired.com

See on Scoop.itIT nieuws Nederland

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?

John Lasschuit ®™‘s insight:

Very interesting!

See on www.wired.com