Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications

This paper reviews the problems of Boolean non‐linear programming related to the half‐product problem. All problems under consideration have a similar quadratic non‐separable objective function. For these problems, we focus on the development of fully polynomial‐time approximation schemes, especially of those with strongly polynomial time, and on their applications to various scheduling problems.