[Top][All Lists]

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

Re: [Help-glpk] binary boolean

From: Andrew Makhorin
Subject: Re: [Help-glpk] binary boolean
Date: Sat, 05 May 2012 12:49:39 +0400

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]