A new Branch and Bound algorithm for MIQPs - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

A new Branch and Bound algorithm for MIQPs

Abstract

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.
No file

Dates and versions

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

Identifiers

  • HAL Id : hal-01126099 , version 1

Cite

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 View
0 Download

Share

Gmail Facebook X LinkedIn More