Technical Note—A Note on Zero-One Integer and Concave Programming

Abstract

It has been shown that the zero-one linear integer programming problem can be formulated as a minimization of a concave quadratic objective function subject to linear constraints. This note extends the concept to a broad class of concave objective functions.