Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164)
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: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem |
scientific article; zbMATH DE number 6562677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem |
scientific article; zbMATH DE number 6562677 |
Statements
Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (English)
0 references
4 April 2016
0 references
degree constrained spanning tree
0 references
branch-and-cut
0 references
branch-and-cut-and-price
0 references
0 references
0.8976589441299438
0 references
0.8866575360298157
0 references
0.8801776766777039
0 references
0.8761019706726074
0 references
0.8693681955337524
0 references
