English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

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

MPS-Authors
/persons/resource/persons44149

Bockmayr,  Alexander
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44739

Kasper,  Thomas
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bockmayr, A., & Kasper, T. (1996). Pseudo-Boolean and Finite Domain Constraint Programming: A Case Study. In U. Geske, & H. Simonis (Eds.), Deklarative Constraint Programmierung (pp. 29-41). Sankt Augustin, Germany: GMD.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ABFD-6
Abstract
Pseudo-Boolean constraints are a special form of finite domain constraints where all variables are defined over the domain $\{0,1\}$. To solve pseudo-Boolean constraints, specialized constraint solving algorithms have been developed. In this paper, we compare finite domain and pseudo-Boolean constraint techniques on a classical application of finite domain constraint programming, the warehouse location problem. Although the finite 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 efficient.