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 this page instead for the normal view: Lower bounds and exact algorithms for the quadratic minimum spanning tree problem |
scientific article; zbMATH DE number 6654031
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
