| Home : September 14 2012 Computer News : A Travelling Salesman Problem special case: 30-year-old problem solved |
|
A Travelling Salesman Problem special case: 30-year-old problem solved |
September 14, 2012
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.
Link: http://feeds.sciencedaily.com/~r/sciencedaily/computers_math/computer_science/~3/KjaAo3-IozA/120913091939.htm
|
|
|
|
|
