Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimization of a 532-city symmetric traveling salesman problem by branch and cut |
scientific article; zbMATH DE number 4003927
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimization of a 532-city symmetric traveling salesman problem by branch and cut |
scientific article; zbMATH DE number 4003927 |
Statements
Optimization of a 532-city symmetric traveling salesman problem by branch and cut (English)
0 references
1987
0 references
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.
0 references
polyhedral methods
0 references
software design
0 references
branch and cut
0 references
532-city symmetric traveling salesman
0 references
