Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297)
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 7102739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem |
scientific article; zbMATH DE number 7102739 |
Statements
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (English)
0 references
9 September 2019
0 references
combinatorial optimization
0 references
spanning trees
0 references
Lagrangian relaxation
0 references
semidefinite programming
0 references
semi-infinite programming
0 references
0 references
0 references
0 references
0 references
0 references
0.8542347550392151
0 references
0.8158338665962219
0 references
0.8156877756118774
0 references
0.7956424355506897
0 references
