Pseudo-Boolean and Finite Domain Constraint Programming: A Case Study

Pseudo-Boolean constraints are a special form of nite domain constraints where all variables are deened over the domain f0; 1g. To solve pseudo-Boolean constraints, specialized constraint solving algorithms have been developed. In this paper, we compare nite domain and pseudo-Boolean constraint techniques on a classical application of nite domain constraint programming, the warehouse location problem. Although the nite domain model is very natural and theoretically has a much smaller search space, the 0-1 model with specialized constraint solving techniques turns out to be more eecient.