Sherali-Adams Relaxations for Valued CSPs.
Johan ThapperStanislav ZivnýPublished in: ICALP (1) (2015)
Keyphrases
- constraint satisfaction problems
- lp relaxation
- constraint satisfaction
- np hard
- constraint propagation
- arc consistency
- lower bound
- linear programming
- mixed integer
- semidefinite
- solving constraint satisfaction problems
- non binary
- constraint problems
- tree decomposition
- backtracking algorithm
- hypertree decomposition
- search space
- constraint networks
- constraint programming
- convex relaxation
- feasible solution
- constraint graph
- configuration problems
- distributed constraint satisfaction
- global constraints
- multi valued
- temporal constraints
- integer programming
- message passing
- np complete
- special case
- partial constraint satisfaction