Minimization of Linear Pseudo-Boolean Functions
The results of the preceding two chapters will now be used in order to solve pseudo-Boolean programs, that is problems of minimizing (maximizing) pseudo-Boolean functions with variables possibly subject to pseudo-Boolean constraints.
Unable to display preview. Download preview PDF.
- As it was shown by R. Fortet , any pseudo-Boolean program may be reduced to a program of this type, by introduction of certain supplementary variables (see Theorem IV. 4).Google Scholar