Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems.
Sven LöfflerKe LiuPetra HofstedtPublished in: ICAART (2) (2019)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- optimization problems
- russian doll search
- constraint programming
- constraint propagation
- phase transition
- search space
- arc consistency
- evolutionary algorithm
- np hard
- product configuration
- combinatorial problems
- np complete
- non binary
- forward checking
- hard constraints
- metaheuristic
- search strategies
- cost function
- soft constraints
- sat problem
- constraint solving
- combinatorial optimization
- constraint optimization
- backtracking search
- sat solvers
- constraint solver
- partial constraint satisfaction