非表示:
キーワード:
-
要旨:
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.
