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 this page instead for the normal view: A new upper bound for the traveling salesman problem in cubic graphs |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new upper bound for the traveling salesman problem in cubic graphs |
scientific article |
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