Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052)
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 6654031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds and exact algorithms for the quadratic minimum spanning tree problem |
scientific article; zbMATH DE number 6654031 |
Statements
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (English)
0 references
17 November 2016
0 references
quadratic 0-1 programming
0 references
Lagrangian relaxation
0 references
spanning trees
0 references
0 references
0 references
0.9170475006103516
0 references
0.9093673825263976
0 references
0.8684605956077576
0 references
