Title: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
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.
Publication Year: 1987
Publication Date: 1987-03-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 386
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot