Lower and upper bounds for the degree-constrained minimum spanning tree problem (Q3593370)
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 and upper bounds for the degree-constrained minimum spanning tree problem |
scientific article; zbMATH DE number 5173297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper bounds for the degree-constrained minimum spanning tree problem |
scientific article; zbMATH DE number 5173297 |
Statements
Lower and upper bounds for the degree-constrained minimum spanning tree problem (English)
0 references
20 July 2007
0 references
Lagrangian relaxation
0 references
non-delayed relax-and-cut
0 references
Lagrangian warm start to cutting plane algorithms
0 references
degree constrained minimum spanning tree
0 references
blossom inequalities
0 references
0.8645513653755188
0 references
0.8556477427482605
0 references
0.8536170721054077
0 references
0.8453779220581055
0 references
0.8341816067695618
0 references
