"Salesman Tom is about to hit the road for a month long journey to visit customers and sales prospects, a trip that will take him to 50 destinations across the United States.
Tom needs to optimize the trip by three priorities. He must first maximize the time he spends with each client. Second, he must complete the trip in the shortest possible distance. Finally, he needs to do it at the lowest possible cost.
This variation on the classic "traveling salesman problem" would take one of today's off-the-shelf computer servers decades to solve definitively, if it could solve the problem at all. A quantum computer could knock it off in seconds..."
Read More ...