A new Branch and Bound algorithm for MIQPs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

A new Branch and Bound algorithm for MIQPs

Résumé

Let (MQP) be a MIQP that consists in minimizing a quadratic function subject to linear constraints. Our approach to solve (MQP) is first to consider (MQP'), an equivalent MIQP that has a convex objective function, additional variables and constraints, and additionnal quadratic constraints. Then, we propose a new Branch and Bound based on the relaxation of the quadratic constraints to solve (MQP'). We perform experiments on pure-and mixed-integer instances of medium size, and show that their solution times are improved by our Branch and Bound in comparison with two existing approaches.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01126099 , version 1

Citer

Alain Billionnet, Sourour Elloumi, Amélie Lambert. A new Branch and Bound algorithm for MIQPs. EURO 2012, Jul 2012, Vilnius, Liechtenstein. pp.57. ⟨hal-01126099⟩
67 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More