Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes.
David W. FowlerKenneth N. BrownPublished in: CP (2000)
Keyphrases
- constraint satisfaction problems
- combinatorial problems
- constraint satisfaction
- solving constraint satisfaction problems
- constraint programming
- constraint propagation
- backtrack search
- hyper heuristics
- search space
- np complete
- soft constraints
- dynamic constraint satisfaction problems
- finding optimal solutions
- arc consistency
- non binary
- partial constraint satisfaction
- constraint solving
- graph coloring problems
- np hard
- configuration problems
- decomposition methods
- product configuration
- branch and bound
- finite domain
- optimal solution
- variable ordering heuristics
- backtracking search
- random instances
- constraint solver
- constraint problems
- temporal constraints
- constraint networks
- forward checking
- constraint graph
- global constraints
- evolutionary algorithm
- highly efficient
- sat problem