Convex reformulations for binary quadratic programs

Abstract : -Let (QP) be a binary 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. Our reformulation, that we call EQCR (Extended Quadratic Convex Reformulation), is optimal from the continuous relaxation bound point of view. We show that this best reformulation can be deduced from the solution of a semidefinite relaxation of (QP) and that EQCR outperforms QCR. We carry out computational experiments on Max-Cut and on the k-cluster problem.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01125632
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:21:58 AM
Last modification on : Thursday, February 6, 2020 - 5:41:18 PM

Identifiers

  • HAL Id : hal-01125632, version 1

Collections

Citation

Alain Billionnet, Sourour Elloumi, Amélie Lambert. Convex reformulations for binary quadratic programs. EURO 2009, 23rd European Conference on Operational Research, Jul 2009, Bonn, Germany. pp.47. ⟨hal-01125632⟩

Share

Metrics

Record views

95