2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Local elimination in the traveling salesman problem
William Cook, Keld Helsgaun, Stefan Hougardy +1
Hougardy and Schroeder (WG 2014) proposed a combinatorial technique for pruning the search space in the traveling salesman problem, establishing that, for a given instance, certain…
cs.DM2014★ 2 cited
Edge Elimination in TSP Instances
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…