A new algorithm for constraint satisfaction problems with Maltsev templates.
Dejan DelicAklilu HabtePublished in: CoRR (2017)
Keyphrases
- constraint satisfaction problems
- search space
- np hard
- optimal solution
- computational complexity
- cost function
- worst case
- constraint programming
- finding optimal solutions
- special case
- search algorithm
- simulated annealing
- objective function
- combinatorial optimization
- space complexity
- combinatorial problems
- non binary
- graph coloring
- constraint solver
- pseudo boolean optimization