There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

Abstract

This paper studies a class of integer programming problems in which squares of variables may occur in the constraints, and shows that no computing device can be programmed to compute the optimum criterion value for all problems in this class.