Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778)
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: Optimality cuts and a branch-and-cut algorithm for the k-rooted mini-max spanning forest problem |
scientific article; zbMATH DE number 6633671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem |
scientific article; zbMATH DE number 6633671 |
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
0.9707779
0 references
0.9449578
0 references
0.9194486
0 references
0.9141976
0 references
0.90962183
0 references
0.9094223
0 references
0.9018731
0 references
0.9014286
0 references
0.90064853
0 references
