1 square de la resistance

Sainte-Foy-lès-Lyon, France

1 square de la resistance

Sainte-Foy-lès-Lyon, France
SEARCH FILTERS
Time filter
Source Type

Billionnet A.,1 square de la resistance | Elloumi S.,1 square de la resistance | Lambert A.,French National Conservatory of Arts and Crafts
Mathematical Programming | Year: 2015

We propose a solution approach for the general problem (QP) of minimizing a quadratic function of bounded integer variables subject to a set of quadratic constraints. The resolution is based on the reformulation of the original problem (QP) into an equivalent quadratic problem whose continuous relaxation is convex, so that it can be effectively solved by a branch-and-bound algorithm based on quadratic convex relaxation. We concentrate our efforts on finding a reformulation such that the continuous relaxation bound of the reformulated problem is as tight as possible. Furthermore, we extend our method to the case of mixed-integer quadratic problems with the following restriction: all quadratic sub-functions of purely continuous variables are already convex. Finally, we illustrate the different results of the article by small examples and we present some computational experiments on pure-integer and mixed-integer instances of (QP). Most of the considered instances with up to 53 variables can be solved by our approach combined with the use of Cplex. © 2015 Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society


Billionnet A.,1 square de la resistance
Environmental Modeling and Assessment | Year: 2015

It is generally accepted that for many species, the ability to get around a reserve promotes their long-term persistence. Here, we measure the ease with which species can move by two spatial criteria: (i) the connectivity of the reserve, that is to say, the possibility to go through the whole reserve without leaving it, and (ii) the compactness of the reserve, that is to say, the remoteness of the sites in relation to each other, the distance between two sites being measured by the shortest distance to travel to get from one site to another without leaving the reserve. To protect the reserve of external disturbances, we also impose a connectivity constraint for the area outside the reserve. This article presents a method based on integer linear programming to define connected and compact reserves. Computational experiments carried out on artificial instances with 400 sites and 100 species are presented to illustrate the effectiveness of the approach. © 2015 Springer International Publishing Switzerland

Loading 1 square de la resistance collaborators
Loading 1 square de la resistance collaborators