Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334)
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: Solving the 2-rooted mini-max spanning forest problem by branch-and-bound |
scientific article; zbMATH DE number 5643699
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the 2-rooted mini-max spanning forest problem by branch-and-bound |
scientific article; zbMATH DE number 5643699 |
Statements
Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (English)
0 references
7 December 2009
0 references
combinatorial optimization
0 references
branch-and-bound
0 references
spanning forest
0 references
bottleneck criterion
0 references
0.9501662
0 references
0.9325193
0 references
0.9194486
0 references
0.90779257
0 references
0.90388584
0 references
0.8965311
0 references
0.8871003
0 references
0 references
