Optimization of a 532-city symmetric traveling salesman problem by branch and cut
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 \textit{H. Crowder} and \textit{M. Padberg} [Manage. Sci. 26, 495-509 (1980; Zbl 0444.90068)] are cross- validated. In this note we briefly outline the methodology, algorithms and software system that we developed to obtain these results.
scientific article; zbMATH DE number 4003927
scientific article