Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_29 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2618773733 / rank | |||
Normal rank | |||
Revision as of 02:34, 20 March 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
