There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

Published Online:https://doi.org/10.1287/opre.21.1.221

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.