On the solution of traveling salesman problems (Q1126862)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1184401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the solution of traveling salesman problems |
scientific article; zbMATH DE number 1184401 |
Statements
On the solution of traveling salesman problems (English)
0 references
6 August 1998
0 references
Summary: Following the theoretical studies of J. B. Robinson and H. W. Kuhn in the late 1940s and the early 1950s, G. B. Dantzig, R. Fulkerson, and S. M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TSP instances with more than several hundred cities; over the years, it has evolved further through the work of M. Grötschel, S. Hong, M. Jünger, P. Miliotis, D. Naddef, M. Padberg, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, and others. We enumerate some of its refinements that led to the solution of a 13,509-city instance.
0 references
traveling salesman
0 references
cutting planes
0 references
0.8613829016685486
0 references
0.8606275916099548
0 references
