Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Say we wanna compute the TSP for a given, complete graph G with V vertices and E edges (by complete I mean : every vertex is connected with every other vertex).
I’ll try to ask the question again. Hopefully I’ll get it right this time.
My goal is simple :
For this complete graph G, how does one filter out some edges that will probably not be in the graph?
Keld Helsgaun’s implementation of Lin-Kernighan measures the quality of an edge e as [min cost of a 1-tree including e] – [min cost of a 1-tree] (lower is better). See Section 4.1.