Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey.
Gregory Z. GutinAnders YeoPublished in: The Multivariate Algorithmic Revolution and Beyond (2012)
Keyphrases
- constraint satisfaction problems
- tight bounds
- upper bound
- constraint satisfaction
- constraint programming
- np complete
- constraint propagation
- search space
- np hard
- product configuration
- arc consistency
- combinatorial problems
- constraint solving
- non binary
- constraint networks
- sat problem
- soft constraints
- disjunctive temporal
- global constraints
- tractable subclasses
- temporal constraints
- backtracking search
- pseudo boolean optimization
- arithmetic constraints
- solving constraint satisfaction problems
- configuration problems
- finite domain
- state space
- constraint problems
- heuristic search
- phase transition