Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization

Barth, Peter

MPI-I-95-2-003. January 1995, 13 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
The Davis-Putnam enumeration method (DP) has recently become one
of the fastest known methods for solving the clausal satisfiability
problem of propositional calculus.
We present a generalization of the DP-procedure for solving the
satisfiability problem of a set of linear pseudo-Boolean (or 0-1)
inequalities. We extend the method to solve linear 0-1 optimization
problems, i.e.\ optimize a linear pseudo-Boolean objective function
w.r.t.\ a set of linear pseudo-Boolean inequalities. The algorithm
compares well with traditional linear programming based methods on
a variety of standard 0-1 integer programming benchmarks.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-95-2-003.ps235 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Barth, Peter},
  TITLE = {A {Davis-Putnam} based enumeration algorithm for linear pseudo-{Boolean} optimization},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-95-2-003},
  MONTH = {January},
  YEAR = {1995},
  ISSN = {0946-011X},