A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems (Q3652111)
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 5649269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems |
scientific article; zbMATH DE number 5649269 |
Statements
A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems (English)
0 references
17 December 2009
0 references
\(k\)-minimum spanning tree
0 references
tabu search
0 references
ant colony optimization
0 references
hybrid algorithm
0 references
approximate solution
0 references
0.90655464
0 references
0.88504195
0 references
0.8847577
0 references
0.88243735
0 references
0.87997425
0 references
