Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Gecode / rank | |||
Normal rank | |||
Revision as of 13:20, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem |
scientific article |
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
