Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the 2-rooted mini-max spanning forest problem by branch-and-bound |
scientific article |
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
