Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem (Q3026701)
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 4014407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem |
scientific article; zbMATH DE number 4014407 |
Statements
Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem (English)
0 references
1987
0 references
Network design
0 references
Optimum Communication Spanning Tree
0 references
branch and bound
0 references
heuristic
0 references
0.8569048047065735
0 references
0.8553847074508667
0 references
0.8258273005485535
0 references
0.8232635855674744
0 references
0.8222057819366455
0 references
