A Travelling Salesman Problem special case: 30-year-old problem solved
Thursday, September 13, 2012 - 15:40
in Mathematics & Economics
The science of computational complexity aims to solve the TSP -- the Travelling Salesman Problem -- when the time required to find an optimal solution is vital for practical solutions to modern-day problems such as air traffic control and delivery of fresh food. Researchers have now solved a 30-year-old TSP special case problem.