Cheap and Secure Web Hosting Provider : See Now

[Answers] TSP Edge Removal

, , No Comments
Problem Detail: 

Are there any papers/algorithms for finding edges in a graph that can be removed with affecting the graph's optimal TSP tour length?

For instance, in a Euclidean TSP instance, many edges could be ruled out for being too long (i.e., jumping between very far apart nodes) given a decent upper bound on the optimal tour length. Is there some efficient heuristic algorithm for eliminating edges like this?

Asked By : b2coutts

Answered By : Bill Cook

See "Edge elimination in TSP instances", Hougardy and Schroeder, 2014, http://arxiv.org/abs/1402.7301

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/56801

3.2K people like this

 Download Related Notes/Documents

0 comments:

Post a Comment

Let us know your responses and feedback