The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms (Q4347415)
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: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms |
scientific article; zbMATH DE number 1045780
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms |
scientific article; zbMATH DE number 1045780 |
Statements
The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms (English)
0 references
7 August 1997
0 references
computational complexity
0 references
travelling salesman
0 references
bottleneck TSP formulations
0 references
heuristics
0 references
