Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
Abstract We study mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We present MIP relaxation methods for non-convex continuous variable products. In this paper, we consider MIP relaxations based on separable reformulation. The main focus is the introduction of the enhanced separable …