Two Algorithmic Results for the Traveling Salesman Problem (Q4880877)
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 892141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two Algorithmic Results for the Traveling Salesman Problem |
scientific article; zbMATH DE number 892141 |
Statements
Two Algorithmic Results for the Traveling Salesman Problem (English)
0 references
3 October 1996
0 references
polynomial time algorithm
0 references
Hamiltonian circuit
0 references
permanent of a matrix
0 references
0.800337553024292
0 references
0.8002563118934631
0 references
0.7942981123924255
0 references
