Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances.
George BoukeasPanagiotis StamatopoulosConstantinos HalatsisVassilis ZissimopoulosPublished in: SETN (2004)
Keyphrases
- constraint satisfaction problems
- search space
- finding optimal solutions
- constraint satisfaction
- random instances
- backtrack search
- constraint propagation
- pseudo boolean optimization
- tractable classes
- constraint programming
- search algorithm
- heuristic search
- search strategy
- constraint networks
- constraint solving
- combinatorial problems
- branch and bound
- search tree
- metaheuristic
- reduce the search space
- arc consistency
- non binary
- optimal solution
- binary csps
- temporal constraints
- np complete
- constraint solver
- soft constraints
- sat problem
- partial solutions
- finite domain
- forward checking
- genetic algorithm
- state space
- np hard
- benchmark instances
- decomposition methods
- global consistency
- partial constraint satisfaction
- sat solvers
- randomly generated