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 this page instead for the normal view: Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem |
scientific article |
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
