Abstract
We report the solution to optimality of a 532-city symmetric traveling salesman problem involving the optimization over 141,246 zero-one variables. The results of an earlier study by Crowder and Padberg [1] are cross-validated. In this note we briefly outline the methodology, algorithms and software system that we developed to obtain these results.
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.
