Convex reformulations of mixed-integer quadratically constrained programs - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Convex reformulations of mixed-integer quadratically constrained programs

Abstract

We present a solution approach for the general problem (QP) of minimizing a quadratic function of integer variables subject to a set of quadratic constraints. The resolution is divided into two phases. The ?rst phase is to reformulate the initial problem as an equivalent quadratic problem which continuous relaxation is convex; the second phase is to solve the reformulated problem by a branch and bound algorithm. We further extend these results to the mixed-integer case. Finally, we present some computational experiments on pure-integer and mixed-integer instances of (QP ).
No file

Dates and versions

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

Identifiers

  • HAL Id : hal-01126271 , version 1

Cite

Alain Billionnet, Sourour Elloumi, Amélie Lambert. Convex reformulations of mixed-integer quadratically constrained programs. EUROPT 2013, Jun 2013, Florence, Italy. pp.24. ⟨hal-01126271⟩
46 View
0 Download

Share

Gmail Facebook X LinkedIn More