New bounds and constraint propagation techniques for the clique partitioning problem.
Florian JaehnErwin PeschPublished in: Discret. Appl. Math. (2013)
Keyphrases
- constraint propagation
- constraint satisfaction problems
- constraint programming
- constraint solving
- constraint reasoning
- lower bound
- constraint satisfaction
- upper bound
- temporal constraints
- arc consistency
- worst case
- backtracking algorithms
- systematic search
- constraint graph
- constrained problems
- constraint solver
- tree search
- soft constraints
- finite domain
- quantifier elimination
- interval arithmetic
- interval analysis
- search space
- graph partitioning
- np hard
- data model
- relational databases