New exact algorithms for the 2-constraint satisfaction problem.
Alexander GolovnevKonstantin KutzkovPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- exact algorithms
- constraint satisfaction problems
- combinatorial problems
- constraint satisfaction
- constraint programming
- knapsack problem
- benchmark instances
- np hard
- max sat
- approximation algorithms
- np complete
- sat problem
- search space
- computational problems
- constraint solving
- constraint propagation
- exact solution
- non binary
- combinatorial optimization
- arc consistency
- global constraints
- constraint networks
- heuristic methods
- soft constraints
- constraint problems
- finding optimal solutions
- combinatorial optimization problems
- metaheuristic
- orders of magnitude
- dynamic programming
- search algorithm