Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657)
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: Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem |
scientific article; zbMATH DE number 6633621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem |
scientific article; zbMATH DE number 6633621 |
Statements
Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (English)
0 references
6 October 2016
0 references
integer programming
0 references
spanning tree
0 references
branch vertices
0 references
0 references
0 references
0.8735571503639221
0 references
0.8720943331718445
0 references
0.866834819316864
0 references
0.861786425113678
0 references
0.8606845736503601
0 references
