OPBDP is an implementation in C++ of an implicit enumeration algorithm for solving (non)linear 0-1 (or pseudo-Boolean) optimization problems with integer coefficients. A Research Report from the Max-Planck-Institut describing the techniques used in opbdp is included.
For an in-depth treatment of logic-based constraint solving techniques see Logic-Based 0-1 Constraint Programming OR/CS Interface Series, 1996, Kluwer.
For downloads, news, etc. check the OPBDP Project Page.