ORL
2008
13 years 10 months ago
2008
![Searching the k-change neighborhood for TSP is W[1]-hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Searching the k-change neighborhood for TSP is W[1]-hard")
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
AAAI
1998
14 years 7 days ago
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
AAAI
2006
14 years 8 days ago
2006
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...