Sherali-Adams relaxations for valued CSPs
We consider Sherali-Adams linear programming relaxations for solving valued constraint satisfaction problems to optimality. The utility of linear programming relaxations in this context have previously been demonstrated using the lowest possible level of this hierarchy under the name of the basic li...
| Autors principals: | , |
|---|---|
| Format: | Conference item |
| Idioma: | English |
| Publicat: |
Springer Berlin Heidelberg
2015
|