Approximation for Maximum Surjective Constraint Satisfaction Problems
Walter BachHang ZhouPublished in: CoRR (2011)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- np complete
- constraint propagation
- constraint programming
- search space
- combinatorial problems
- finite domain
- np hard
- constraint networks
- non binary
- constraint solving
- arc consistency
- product configuration
- optimal solution
- arithmetic constraints
- computational problems
- temporal constraints
- decomposition methods
- constraint optimization
- solving constraint satisfaction problems
- finding optimal solutions
- path consistency
- soft constraints
- symmetry breaking
- constraint problems
- constraint solver
- constraint graph
- backtracking search
- objective function
- tractable subclasses
- disjunctive temporal