The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663)
From MaRDI portal
!
WARNING
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 6484195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm |
scientific article; zbMATH DE number 6484195 |
Statements
The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (English)
0 references
22 September 2015
0 references
combinatorial optimization
0 references
min-degree constrained minimum spanning tree problem
0 references
branch-and-cut
0 references
integer programming formulations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9361701607704164
0 references
0.910690188407898
0 references
0.8905337452888489
0 references
0.8801776766777039
0 references
