The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962)
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 5661554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching |
scientific article; zbMATH DE number 5661554 |
Statements
The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (English)
0 references
22 January 2010
0 references
symmetric travelling salesman problem
0 references
lower bound
0 references
matching problem
0 references
symmetric matrix
0 references
running time
0 references
0 references
0 references
0 references
0.908616304397583
0 references
0.8871713876724243
0 references
0.8778160810470581
0 references
0.8468712568283081
0 references
0.8468712568283081
0 references
