Algorithms for solution of the travelling salesman problem. II: New lower bound (Q1913835)
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 882137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for solution of the travelling salesman problem. II: New lower bound |
scientific article; zbMATH DE number 882137 |
Statements
Algorithms for solution of the travelling salesman problem. II: New lower bound (English)
0 references
9 June 1996
0 references
polynomial lower bounds
0 references
traveling salesman
0 references
0.8588091731071472
0 references
0.8498836159706116
0 references
0.8468712568283081
0 references
