Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610)
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: Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem |
scientific article; zbMATH DE number 6756599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem |
scientific article; zbMATH DE number 6756599 |
Statements
Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (English)
0 references
4 August 2017
0 references
0.7928643226623535
0 references
0.779758870601654
0 references
0.7723861336708069
0 references
0.7532834410667419
0 references
0.7419625520706177
0 references
