The Next Web

At last! There’s an algorithm that’s closer than ever to solving the traveling salesperson problem

Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many teaspoons in a tablespoon? For questions like these, they’ve got ...
Yahoo

Planning the best route with multiple destinations is hard even for supercomputers – a new approach breaks a barrier that's stood for nearly half a century

Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many teaspoons in a tablespoon? For questions like these, they’ve got ...
GIGAZINE

The best algorithm for finding an approximate solution to the difficult mathematical problem 'Traveling Salesman Problem' is updated for the first time in decades

The traveling salesman problem is one of the basic problems that many theoretical computer scientists have been working on. Many scientists think that there is no algorithm for the traveling salesman ...