An iterative method for zero-one minimization of integer polynomials, linear in each variable, is outlined. It is based on Camion's method of binary developments with computations using multiplication and sum mod 2. The method is straightforward, does not require any branching or solving of intequalities, but, as with any Boolean method, may involve storage and retrieval problems. A general formula is derived which may serve as a basis for a more direct approach.
