Convex reformulations for integer quadratic programs

Abstract : -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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01125634
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:22:03 AM
Last modification on : Thursday, February 6, 2020 - 5:39:56 PM

Identifiers

  • HAL Id : hal-01125634, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

35