Branching Schemes and Variable Ordering Heuristics for Constraint Satisfaction Problems: Is There Something to Learn?
José Carlos Ortiz-BaylissHugo Terashima-MarínSantiago Enrique Conant-PablosPublished in: NICSO (2013)
Keyphrases
- variable ordering heuristics
- constraint satisfaction problems
- constraint satisfaction
- search space
- constraint programming
- constraint propagation
- np complete
- arc consistency
- np hard
- combinatorial problems
- solving constraint satisfaction problems
- soft constraints
- constraint networks
- search algorithm
- constraint solving
- backtracking search
- global constraints
- reasoning problems
- sat problem
- backtracking algorithm
- forward checking
- constraint solver
- constraint problems
- non binary
- temporal constraints
- scheduling problem