MPI-I-95-2-003
A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization
Barth, Peter
January 1995, 13 pages.
.
Status: available - back from printing
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.
-
- Attachement: MPI-I-95-2-003.ps (235 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1995-2-003
BibTeX
@TECHREPORT{Barth-95-mpii2003,
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},
}