A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933)
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 5681574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid heuristic for the diameter constrained minimum spanning tree problem |
scientific article; zbMATH DE number 5681574 |
Statements
A hybrid heuristic for the diameter constrained minimum spanning tree problem (English)
0 references
15 March 2010
0 references
GRASP
0 references
iterated local search
0 references
0 references
0 references
0.9557266
0 references
0.9395587
0 references
0.93333733
0 references
0.9279683
0 references
0.9199924
0 references
