A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257)
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 branch-and-cut algorithm for the minimum branch vertices spanning tree problem |
scientific article; zbMATH DE number 6901393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the minimum branch vertices spanning tree problem |
scientific article; zbMATH DE number 6901393 |
Statements
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (English)
0 references
11 July 2018
0 references
spanning tree
0 references
branch vertices
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0.94900495
0 references
0.94787616
0 references
0.9395126
0 references
0.93030936
0 references
0.92996323
0 references
0.92951643
0 references
0.92715263
0 references
0.92654586
0 references
