A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227)
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 6998898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid metaheuristic for the minimum labeling spanning tree problem |
scientific article; zbMATH DE number 6998898 |
Statements
A hybrid metaheuristic for the minimum labeling spanning tree problem (English)
0 references
9 January 2019
0 references
metaheuristic
0 references
edge-labeled graph
0 references
spanning tree
0 references
complexity analysis
0 references
0 references
0 references
0.8430363535881042
0 references
0.8256450891494751
0 references
0.8197129964828491
0 references
0.808029055595398
0 references
