Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem.
Maël MinotSamba Ndojh NdiayeChristine SolnonPublished in: CPAIOR (2017)
Keyphrases
- tree decomposition
- tree width
- decomposition method
- probabilistic reasoning
- constraint networks
- parallel processing
- branch and bound
- constraint programming
- answer set programming
- graph theory
- constraint satisfaction problems
- tree decompositions
- inductive logic programming
- decomposition methods
- objective function
- normal form
- temporal information
- constraint satisfaction
- upper bound