The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838)
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 traveling salesman problem: new polynomial approximation algorithms and domination analysis |
scientific article; zbMATH DE number 1720060
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The traveling salesman problem: new polynomial approximation algorithms and domination analysis |
scientific article; zbMATH DE number 1720060 |
Statements
The traveling salesman problem: new polynomial approximation algorithms and domination analysis (English)
0 references
2001
0 references
0 references
0.9316488
0 references
0.9268062
0 references
0.92487514
0 references
0.9223874
0 references
0.9195347
0 references
0 references
0.9186758
0 references
