Branch-cut-and-propagate for the maximum \(k\)-colorable subgraph problem with symmetry (Q3003279)
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: Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry |
scientific article; zbMATH DE number 5900034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-cut-and-propagate for the maximum \(k\)-colorable subgraph problem with symmetry |
scientific article; zbMATH DE number 5900034 |
Statements
Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry (English)
0 references
26 May 2011
0 references
0.8551393151283264
0 references
0.7903652191162109
0 references
0.7602158784866333
0 references
0.7543563842773438
0 references
