English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Methods and Tools for Pseudo-Boolean Problems

MPS-Authors
/persons/resource/persons44149

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

/persons/resource/persons44073

Barth,  Peter
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., Barth, P., & Kasper, T. (1996). Methods and Tools for Pseudo-Boolean Problems. In B. Steinbach (Ed.), 2. Workshop Boolesche Probleme (pp. 105-109). Freiberg, Sachsen: TU Bergakademie Freiberg, Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ABE6-5
Abstract
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with arithmetic. A pseudo-Boolean problem is defined by equations and inequalities between integer polynomials in 0-1 variables. We describe methods and tools for solving pseudo-Boolean problems that combine techniques from automated deduction and operations research. The basic idea is to compute strong valid inequalities for the underlying set of 0-1 vectors.