Boolean simplification and integer inequalities
John Wilson · The Computer Journal · 1977
A method for the minimisation of Boolean expressions is presented. The algorithm has as its basis the Quine approach, but it is geared to handling larger sets of Boolean variables, rather than small sets of variable encountered in traditional examples. These larger sets of variables occur when a Boolean minimisation process is incorporated in an Integer Programming algorithm.