English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

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

MPS-Authors
/persons/resource/persons44073

Barth,  Peter
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)

MPI-I-95-2-003.pdf
(Any fulltext), 248KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Barth, P.(1995). A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization (MPI-I-1995-2-003). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-A1C6-1
Abstract
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.