Solving the quadratic minimum spanning tree problem (Q387698)
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 6242159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the quadratic minimum spanning tree problem |
scientific article; zbMATH DE number 6242159 |
Statements
Solving the quadratic minimum spanning tree problem (English)
0 references
23 December 2013
0 references
quadratic minimum spanning tree problem
0 references
binary quadratic programming
0 references
tabu search
0 references
variable neighbourhood search
0 references
branch-and-bound
0 references
0 references
0.95648336
0 references
0.93770957
0 references
0.9270781
0 references
0.9084252
0 references
0.8997082
0 references
0.8925024
0 references
0.89247686
0 references
0.89041656
0 references
0 references
