Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem (Q3091481)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem |
scientific article |
Statements
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem (English)
0 references
9 September 2011
0 references
