Improving on branch-and-cut algorithms for generalized minimum spanning trees (Q3368660)
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: Improving on branch-and-cut algorithms for generalized minimum spanning trees |
scientific article; zbMATH DE number 5004915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving on branch-and-cut algorithms for generalized minimum spanning trees |
scientific article; zbMATH DE number 5004915 |
Statements
8 February 2006
0 references
0.908158838748932
0 references
0.8884598612785339
0 references
0.8800765872001648
0 references
0.8631893396377563
0 references
0.8617553114891052
0 references
