Abstract
In this article the effect of exchanging edges inside a minimal 1-tree with edges outside is analysed. In combination with an upper bound this analysis enables the elimination of variables in the symmetric traveling salesman problem. After discussion on a number of improvements for this analysis, the implementation is described in a traveling salesman algorithm based on the 1-tree relaxation. Computational results show the advantages of the edges exchanges for Euclidean problems (up to 120 cities) as well as for random table problems (up to 200 cities).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
