de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

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

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44149

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44739

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-ABFD-6
Zusammenfassung
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.