A search algorithm for the minimum cost covering of 0–1 integer sets

This article presents an algorithm for the realization of the minimum cover on a 0–1 integer set with linear constraints. This is done through a search vector which, after each step along the gradient of the objective function, realigns itself on the polyhedra formed by the constraint hypersurfaces. The technique yields convergence to the solution point through fast and straightforward computations. Computational results are given to demonstrate the concepts involved.