From Weak to Strong Linear Programming Gaps for All Constraint Satisfaction Problems.
Mrinalkanti GhoshMadhur TulsianiPublished in: Theory Comput. (2018)
Keyphrases
- constraint satisfaction problems
- linear programming
- constraint propagation
- np hard
- constraint satisfaction
- constraint programming
- linear program
- np complete
- combinatorial problems
- arc consistency
- constraint solving
- search space
- non binary
- finite domain
- decomposition methods
- soft constraints
- constraint networks
- dynamic programming
- sat problem
- product configuration
- constraint problems
- solving constraint satisfaction problems
- backtracking search
- forward checking
- objective function
- disjunctive temporal
- partial constraint satisfaction
- pseudo boolean optimization
- tractable classes
- constraint graph
- optimal solution
- graph coloring problems
- sat encodings