[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Help-glpk] binary boolean

From: Yaron Kretchmer
Subject: Re: [Help-glpk] binary boolean
Date: Sat, 5 May 2012 11:07:43 -0700

Thanks Andrew.
Would it make sense then to incorporate Tseitin's transforms into mathprog as a default method for implementing boolean conditions?


On Sat, May 5, 2012 at 1:49 AM, Andrew Makhorin <address@hidden> wrote:
See also Tseitin's transformations:

These transformations can be used to describe any Boolean function in a
more or less efficient way, in particular, to model any digital circuit
logic like adders, multipliers, dividers, etc.

The mip preprocessor implemented in glpk uses these transformations to
reduce the mip instance to the satisfiablity problem in order to find an
integer feasible solution with the Minisat solver (--minisat).

reply via email to

[Prev in Thread] Current Thread [Next in Thread]