Computer Scientists Find New Shortcuts for Infamous Traveling Salesman Problem http://ifttt.com/images/no_image_card.png

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? The answer has practical applications to processes such as drilling holes in circuit boards, scheduling tasks on a computer and ordering features of a genome. Now, a long-sought advance in the traveling salesman problem is breathing new life into the search for improved approximate solutions.



via Wired Top Stories http://feeds.wired.com/~r/wired/index/~3/IQpbmaQQpL0/