A minimum spanning tree based heuristic for the travelling salesman tour (Q724377)
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 minimum spanning tree based heuristic for the travelling salesman tour |
scientific article; zbMATH DE number 6910338
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimum spanning tree based heuristic for the travelling salesman tour |
scientific article; zbMATH DE number 6910338 |
Statements
A minimum spanning tree based heuristic for the travelling salesman tour (English)
0 references
25 July 2018
0 references
connected network
0 references
minimum spanning tree path
0 references
travelling salesman tour
0 references
0 references
