Technical Note—A Note on Zero-One Programming

Abstract

We generalize a method for constructing facets for the convex hull of integer solutions to set packing problems to arbitrary zero-one problems having nonnegative constraint-matrices. A particular class of facets is obtained explicitly and illustrated by a numerical example.