Convex reformulations for integer quadratic programs - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Convex reformulations for integer quadratic programs


-Let (QP) be an integer quadratic program that consists in minimizing a quadratic function subject to linear constraints. To solve (QP), we reformulate it into an equivalent program with a convex objective function, and we use a Mixed Integer Quadratic Programming solver. This reformulation, called IQCR, is optimal in a certain sense from the continuous relaxation bound point of view. It is deduced from the solution of a SDP relaxation of (QP). Computational experiments are reported.
Not file

Dates and versions

hal-01125634 , version 1 (06-03-2015)


  • HAL Id : hal-01125634 , version 1


Alain Billionnet, Sourour Elloumi, Amélie Lambert. Convex reformulations for integer quadratic programs. 20th International Symposium of Mathematical programming (ISMP), Aug 2009, Chicago, United States. pp.115. ⟨hal-01125634⟩


37 View
0 Download


Gmail Facebook Twitter LinkedIn More