The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal 2-matching
S. I. Sergeev · Automation and Remote Control · 2009
To solve the symmetric travelling salesman problem we suggest a lower bound—the solution of an optimal 2-matching problem. The latter problem is solved (in a polynomial number of steps) not completely, but up to obtaining new stable lower bounds.