Abstract
Tour improvement is used to identify traveling salesman problems which have an optimal pyramidal tour. The work improves and extends the techniques of Burkard and van der Veen, resulting in a wider class of traveling salesman problems with an optimal pyramidal tour that can be recognized in polynomial time. Also, the work reduces the number of iterations in the tour improvement algorithm from quadratic to linear. As a result, it is now possible in linear time to change each tour for some traveling salesman problems to pyramidal without increasing the length of the tour. The theorems in this paper and the Demidenko recognition theorem are not subcases of each other. An example shows that more work is needed to recognize these traveling salesman problems
Sign-in/Register to access full text options 
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.
