Binarisation for Valued Constraint Satisfaction Problems.
David A. CohenMartin C. CooperPeter G. JeavonsAndrei A. KrokhinRobert PowellStanislav ZivnýPublished in: CoRR (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- search space
- constraint propagation
- np complete
- non binary
- constraint programming
- arc consistency
- constraint solving
- np hard
- product configuration
- combinatorial problems
- constraint networks
- global constraints
- computational problems
- finite domain
- tractable subclasses
- pseudo boolean optimization
- sat problem
- decomposition methods
- temporal constraints
- constraint problems
- constraint graph
- constraint optimization
- randomly generated
- constraint solver
- ordering heuristics