Evolving binary constraint satisfaction problem instances that are difficult to solve.
Jano I. van HemertPublished in: IEEE Congress on Evolutionary Computation (2003)
Keyphrases
- constraint satisfaction problems
- finding optimal solutions
- non binary
- constraint satisfaction
- binary csps
- constraint programming
- lower bound
- constraint propagation
- pseudo boolean optimization
- graph coloring problems
- backtrack search
- search space
- random instances
- np complete
- constraint solving
- combinatorial problems
- arc consistency
- np hard
- soft constraints
- tractable classes
- constraint networks
- solving planning problems
- binary constraints
- partial constraint satisfaction
- tractable subclasses
- disjunctive temporal