Solving the minimum labelling spanning tree problem using hybrid local search (Q2840755)
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 6190286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the minimum labelling spanning tree problem using hybrid local search |
scientific article; zbMATH DE number 6190286 |
Statements
Solving the minimum labelling spanning tree problem using hybrid local search (English)
0 references
23 July 2013
0 references
combinatorial optimization
0 references
graphs
0 references
networks
0 references
variable neighbourhood search
0 references
hybrid metaheuristics
0 references
minimum labelling spanning trees
0 references
0 references
0.8781008124351501
0 references
0.871660590171814
0 references
0.8430363535881042
0 references
0.8400377631187439
0 references
0.8372632265090942
0 references
