Generating Random Solutions for Constraint Satisfaction Problems.
Rina DechterKalev KaskEyal BinRoy EmekPublished in: AAAI/IAAI (2002)
Keyphrases
- constraint satisfaction problems
- combinatorial problems
- constraint satisfaction
- random instances
- solving constraint satisfaction problems
- hyper heuristics
- constraint programming
- finding optimal solutions
- constraint propagation
- dynamic constraint satisfaction problems
- backtrack search
- non binary
- np complete
- constraint solving
- search space
- graph coloring problems
- computational problems
- pseudo boolean optimization
- constraint networks
- np hard
- binary csps
- decomposition methods
- arc consistency
- backtracking search
- configuration problems
- optimal solution
- finite domain
- constraint problems
- temporal constraints
- product configuration
- partial assignment
- soft constraints
- constraint solver
- randomly generated
- tractable classes
- phase transition
- traveling salesman problem
- global constraints
- evolutionary algorithm
- sat problem