Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems.
Gilles PesantClaude-Guy QuimperAlessandro ZanariniPublished in: CoRR (2014)
Keyphrases
- constraint satisfaction problems
- variable ordering heuristics
- search space
- backtrack search
- constraint satisfaction
- ordering heuristics
- search algorithm
- constraint programming
- forward checking
- constraint propagation
- backtracking search
- variable ordering
- symmetry breaking
- np complete
- constraint solving
- combinatorial problems
- search strategies
- hyper heuristics
- non binary
- constraint solver
- arc consistency
- search strategy
- search problems
- planning graph
- search heuristics
- np hard
- heuristic search
- branch and bound
- constraint graph
- constraint solvers
- search methods
- random instances
- finding optimal solutions
- partial constraint satisfaction
- solving constraint satisfaction problems
- constraint problems
- metaheuristic
- heuristic search algorithms
- tree search
- soft constraints
- branch and bound search
- sat problem
- constraint networks
- global constraints
- temporal constraints
- search tree
- partial assignment
- upper bound
- scheduling problem
- state space