非表示:
キーワード:
-
要旨:
Pseudo-Boolean constraints are equations or inequalities between integer polynomials in 0-1 variables. On the one hand, they generalize Boolean constraints, on the other hand, they are a restricted form of finite domain constraints. In this paper, we present special constraint solving techniques for the domain {0,1} originating from mathematical programming. The key concepts are the generation of strong valid inequalities for the solution set of a constraint system and the notion of branch-and-cut.