Relax-and-cut as a preprocessor and warm starter to branch-and-cut (Q3109938)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6000603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relax-and-cut as a preprocessor and warm starter to branch-and-cut |
scientific article; zbMATH DE number 6000603 |
Statements
26 January 2012
0 references
degree constrained minimum spanning tree problem
0 references
subtour elimination constraints
0 references
hybrid algorithm
0 references
0.7949527502059937
0 references
0.7797067165374756
0 references
0.7714590430259705
0 references
0.768987238407135
0 references
0.7686571478843689
0 references
