| Article ID: | iaor20011533 |
| Country: | Netherlands |
| Volume: | 23 |
| Issue: | 3/5 |
| Start Page Number: | 89 |
| End Page Number: | 97 |
| Publication Date: | Oct 1998 |
| Journal: | Operations Research Letters |
| Authors: | Kolen A.W.J., Hoesel S.P.M. van, Koster A.M.C.A. |
| Keywords: | satisfiability |
We study the polyhedral structure of the partial constraint satisfaction problem (PCSP). Among the problems that can be formulated as such are the maximum satisfiability problem and a fairly general model of frequency assignment problems. We present lifting theorems and classes of facet defining inequalities, and we provide preliminary experiments.