A new template concept to guide the local search: case of maximal constraint satisfaction problems.
Hajer Ben OthmanSadok BouamamaPublished in: KES (2021)
Keyphrases
- constraint satisfaction problems
- search space
- constraint satisfaction
- constraint programming
- constraint propagation
- backtrack search
- combinatorial problems
- non binary
- np complete
- hard constraints
- np hard
- arc consistency
- decomposition methods
- solving constraint satisfaction problems
- graph coloring problems
- constraint solving
- finite domain
- finding optimal solutions
- sat problem
- constraint problems
- symmetry breaking
- computational problems
- soft constraints
- genetic algorithm
- constraint networks
- global constraints
- combinatorial optimization
- constraint solver
- constraint graph
- global search
- partial assignment
- branch and bound
- pseudo boolean optimization