Browsing Working Papers by Subject "Travelling salesman problems"
Now showing items 1-1 of 1
-
A Review of the Tabu Search Literature on Traveling Salesman Problems
(2009-07-28)he Traveling Salesman Problem (TSP) is one of the most widely studied problems in ombinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on ...