Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(87)90002-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3139666781 / rank | |||
Normal rank | |||
Revision as of 20:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimization of a 532-city symmetric traveling salesman problem by branch and cut |
scientific article |
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
