A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449)
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: A strong symmetric formulation for the min-degree constrained minimum spanning tree problem |
scientific article; zbMATH DE number 6640279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strong symmetric formulation for the min-degree constrained minimum spanning tree problem |
scientific article; zbMATH DE number 6640279 |
Statements
A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (English)
0 references
18 October 2016
0 references
min-degree minimum spanning tree
0 references
branch-and-cut algorithm
0 references
valid inequalities
0 references
0 references
0 references
0 references
0 references
0.9262872
0 references
0.9252169
0 references
0 references
0.9127221
0 references
0.9068747
0 references
0.90675056
0 references
0.9031528
0 references
0.9027472
0 references
0.90268177
0 references
