2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Stefan Hougardy, Rasmus T. Schroeder
The Traveling Salesman Problem is one of the best studied NP-hard problems in combinatorial optimization. Powerful methods have been developed over the last 60 years to find optimu…