A new upper bound for the traveling salesman problem in cubic graphs (Q2250536)
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 6313855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new upper bound for the traveling salesman problem in cubic graphs |
scientific article; zbMATH DE number 6313855 |
Statements
A new upper bound for the traveling salesman problem in cubic graphs (English)
0 references
7 July 2014
0 references
exact algorithms
0 references
traveling salesman problem
0 references
cubic graphs
0 references
Hamiltonian cycle
0 references
0.9178659319877625
0 references
0.875278890132904
0 references
0.8709272146224976
0 references
0.8537248373031616
0 references
0.8493312001228333
0 references
