The travelling salesman and the PQ-tree (Q4645944)
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 and the PQ-tree |
scientific article; zbMATH DE number 7000370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The travelling salesman and the PQ-tree |
scientific article; zbMATH DE number 7000370 |
Statements
The travelling salesman and the PQ-tree (English)
0 references
11 January 2019
0 references
travelling salesman problem
0 references
polynomial algorithm
0 references
dynamic programming
0 references
combinatorial optimization
0 references
Euclidean travelling salesman problem
0 references
PQ-tree
0 references
0 references
0 references
0 references
0.9170407056808472
0 references
0.8185732960700989
0 references
0.8111445307731628
0 references
0.8055795431137085
0 references
