Cost of sequential connection for points in space (Q1122502)
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: Cost of sequential connection for points in space |
scientific article; zbMATH DE number 4106631
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cost of sequential connection for points in space |
scientific article; zbMATH DE number 4106631 |
Statements
Cost of sequential connection for points in space (English)
0 references
1989
0 references
A sequential minimal insertion procedure is used to produce a spanning tree, and the cost is estimated. The technique developed can also be used to the nearest neighbor heuristic for the traveling salseman problem and some other problems.
0 references
sequential minimal insertion procedure
0 references
spanning tree
0 references
nearest neighbor heuristic
0 references
traveling salseman
0 references
0.8220726
0 references
0.8205442
0 references
0.80930805
0 references
0.7981331
0 references
0.7967751
0 references
0.7964031
0 references
0.79471064
0 references
