Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem |
scientific article |
Statements
Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (English)
0 references
6 October 2016
0 references
combinatorial optimization
0 references
branch-and-cut
0 references
\(k\)-rooted mini-max spanning forest problem
0 references
optimality cuts
0 references
0 references
