Alain Billionnet
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alain Billionnet has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Amélie Lambert
CEDRIC-CNAM, Paris Cedex 03, France
3 shared publications - Sourour Elloumi
ENSIIE-CEDRIC 1 square de la résistance FR-91025 Evry
3 shared publications - Ezzeddine Zagrouba
University of Tunis El Manar
2 shared publications - Fethi Jarray
CEDRIC-CNAM
2 shared publications - Angelika Wiegele
Alpen-Adria-Universität Klagenfurt
1 shared publication - Ghassen Tlig
CEDRIC-CNAM, Paris, France
1 shared publication
Latest Publications
- 28 June 2024
- Published by Springer Nature in Environmental Modeling & Assessment
- Vol. 29 (6) , 1-16
Selecting Optimal Multi-species Corridor Networks with Travel-distance, Path-redundancy, and Budget Constraints
- 28 June 2024
- Published by Springer Nature in Environmental Modeling & Assessment
- Vol. 29 (6) , 1-16
Selecting Optimal Multi-species Corridor Networks with Travel-distance, Path-redundancy, and Budget Constraints
- 26 July 2018
- Published by Springer Nature in Biodiversity and Conservation
- Vol. 27 (12) , 3137-3153
Phylogenetic conservation prioritization with uncertainty
- 26 July 2018
- Published by Springer Nature in Biodiversity and Conservation
- Vol. 27 (12) , 3137-3153
Phylogenetic conservation prioritization with uncertainty
- Open Access
- 18 December 2017
- Published by Springer Nature in Biodiversity and Conservation
- Vol. 27 (5) , 1189-1200
Quantifying extinction probabilities of endangered species for phylogenetic conservation prioritization may not be as sensitive as might be feared
- 18 December 2017
- Published by Springer Nature in Biodiversity and Conservation
- Vol. 27 (5) , 1189-1200
Open AccessQuantifying extinction probabilities of endangered species for phylogenetic conservation prioritization may not be as sensitive as might be feared
- 12 June 2017
- Published by Springer Nature in Environmental Modeling & Assessment
- Vol. 22 (6) , 535-548
How to Take into Account Uncertainty in Species Extinction Probabilities for Phylogenetic Conservation Prioritization
- 12 June 2017
- Published by Springer Nature in Environmental Modeling & Assessment
- Vol. 22 (6) , 535-548
How to Take into Account Uncertainty in Species Extinction Probabilities for Phylogenetic Conservation Prioritization
- Open Access
Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
We present algorithm MIQCR-CB that is an advancement of method MIQCR~(Billionnet, Elloumi and Lambert, 2012). MIQCR is a method for solving mixed-integer quadratic programs and works in two phases: the first phase determines an equivalent quadratic formulation with a convex objective function by solving a semidefinite problem $(SDP)$, and, in the second phase, the equivalent formulation is solved by a standard solver. As the reformulation relies on the solution of a large-scale semidefinite program, it is not tractable by existing semidefinite solvers, already for medium sized problems. To surmount this difficulty, we present in MIQCR-CB a subgradient algorithm within a Lagrangian duality framework for solving $(SDP)$ that substantially speeds up the first phase. Moreover, this algorithm leads to a reformulated problem of smaller size than the one obtained by the original MIQCR method which results in a shorter time for solving the second phase. We present extensive computational results to show the efficiency of our algorithm.Open AccessUsing a conic bundle method to accelerate both phases of a quadratic convex reformulation
We present algorithm MIQCR-CB that is an advancement of method MIQCR~(Billionnet, Elloumi and Lambert, 2012). MIQCR is a method for solving mixed-integer quadratic programs and works in two phases: the first phase determines an equivalent quadratic formulation with a convex objective function by solving a semidefinite problem $(SDP)$, and, in the second phase, the equivalent formulation is solved by a standard solver. As the reformulation relies on the solution of a large-scale semidefinite program, it is not tractable by existing semidefinite solvers, already for medium sized problems. To surmount this difficulty, we present in MIQCR-CB a subgradient algorithm within a Lagrangian duality framework for solving $(SDP)$ that substantially speeds up the first phase. Moreover, this algorithm leads to a reformulated problem of smaller size than the one obtained by the original MIQCR method which results in a shorter time for solving the second phase. We present extensive computational results to show the efficiency of our algorithm. - 15 May 2015
- Published by Springer Nature in Environmental Modeling & Assessment
- Vol. 21 (2) , 211-219
Designing Connected and Compact Nature Reserves
- 15 May 2015
- Published by Springer Nature in Environmental Modeling & Assessment
- Vol. 21 (2) , 211-219
Designing Connected and Compact Nature Reserves
- 11 December 2014
- Published by Springer Nature in Environmental Modeling & Assessment
- Vol. 20 (4) , 383-397
Designing Robust Nature Reserves Under Uncertain Survival Probabilities
- 11 December 2014
- Published by Springer Nature in Environmental Modeling & Assessment
- Vol. 20 (4) , 383-397
Designing Robust Nature Reserves Under Uncertain Survival Probabilities
- 14 November 2012
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 28 (2) , 376-399
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- 14 November 2012
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 28 (2) , 376-399
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- 8 November 2012
- Published by Oxford University Press (OUP) in Systematic Biology
- Vol. 62 (1) , 147-156
Solution of the Generalized Noah's Ark Problem
The phylogenetic diversity (PD) of a set of species is a measure of the evolutionary distance among the species in the collection, based on a phylogenetic tree. Such a tree is composed of a root, internal nodes, and leaves that correspond to the set of taxa under study. With each edge of the tree is associated a non-negative branch length (evolutionary distance). If a particular survival probability is associated with each taxon, the PD measure becomes the expected PD measure. In the Noah's Ark Problem (NAP) introduced by Weitzman (1998), these survival probabilities can be increased at some cost. The problem is to determine how best to allocate a limited amount of resources to maximize the expected PD of the considered species. It is easy to formulate the NAP as a (difficult) nonlinear 0-1 programming problem. The aim of this article is to show that a general version of the NAP (GNAP) can be solved simply and efficiently with any set of edge weights and any set of survival probabilities by using standard mixed-integer linear programming software. The crucial point to move from a nonlinear program in binary variables to a mixed-integer linear program, is to approximate the logarithmic function by the lower envelope of a set of tangents to the curve. Solving the obtained mixed-integer linear program provides not only a near-optimal solution but also an upper bound on the value of the optimal solution. We also applied this approach to a generalization of the nature reserve problem (GNRP) that consists of selecting a set of regions to be conserved so that the expected PD of the set of species present in these regions is maximized. In this case, the survival probabilities of different taxa are not independent of each other. Computational results are presented to illustrate potentialities of the approach. Near-optimal solutions with hypothetical phylogenetic trees comprising about 4000 taxa are obtained in a few seconds or minutes of computing time for the GNAP, and in about 30 min for the GNRP. In all the cases the average guarantee varies from 0% to 1.20%.
- 8 November 2012
- Published by Oxford University Press (OUP) in Systematic Biology
- Vol. 62 (1) , 147-156
Solution of the Generalized Noah's Ark Problem
The phylogenetic diversity (PD) of a set of species is a measure of the evolutionary distance among the species in the collection, based on a phylogenetic tree. Such a tree is composed of a root, internal nodes, and leaves that correspond to the set of taxa under study. With each edge of the tree is associated a non-negative branch length (evolutionary distance). If a particular survival probability is associated with each taxon, the PD measure becomes the expected PD measure. In the Noah's Ark Problem (NAP) introduced by Weitzman (1998), these survival probabilities can be increased at some cost. The problem is to determine how best to allocate a limited amount of resources to maximize the expected PD of the considered species. It is easy to formulate the NAP as a (difficult) nonlinear 0-1 programming problem. The aim of this article is to show that a general version of the NAP (GNAP) can be solved simply and efficiently with any set of edge weights and any set of survival probabilities by using standard mixed-integer linear programming software. The crucial point to move from a nonlinear program in binary variables to a mixed-integer linear program, is to approximate the logarithmic function by the lower envelope of a set of tangents to the curve. Solving the obtained mixed-integer linear program provides not only a near-optimal solution but also an upper bound on the value of the optimal solution. We also applied this approach to a generalization of the nature reserve problem (GNRP) that consists of selecting a set of regions to be conserved so that the expected PD of the set of species present in these regions is maximized. In this case, the survival probabilities of different taxa are not independent of each other. Computational results are presented to illustrate potentialities of the approach. Near-optimal solutions with hypothetical phylogenetic trees comprising about 4000 taxa are obtained in a few seconds or minutes of computing time for the GNAP, and in about 30 min for the GNRP. In all the cases the average guarantee varies from 0% to 1.20%.