Adaptive Branching for Constraint Satisfaction Problems
Thanasis BalafoutisKostas StergiouPublished in: CoRR (2010)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- search space
- combinatorial problems
- computational problems
- np hard
- non binary
- constraint optimization
- arc consistency
- constraint networks
- soft constraints
- constraint solving
- decomposition methods
- solving constraint satisfaction problems
- constraint solver
- forward checking
- branch and bound
- backtracking search
- pseudo boolean optimization
- disjunctive temporal
- tractable subclasses
- partial constraint satisfaction
- finding optimal solutions
- arc consistency algorithm
- product configuration
- symmetry breaking
- branch and bound algorithm
- variable ordering heuristics
- search tree
- temporal constraints
- sat problem
- global constraints