Alain Billionnet

Publication Activity (10 Years)

Years Active: 1981-2017
Publications (10 Years): 4

Top Topics

Linear Constraints

Branch And Bound

Quadratic Program

Convex Relaxation

Top Venues

Eur. J. Oper. Res.

J. Math. Model. Algorithms Oper. Res.

J. Rail Transp. Plan. Manag.

Publications

Alain Billionnet, Sourour Elloumi, Amélie Lambert, Angelika Wiegele
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. INFORMS J. Comput. 29 (2) (2017)
Sabine Tréfond, Alain Billionnet, Sourour Elloumi, Housni Djellab, O. Guyon
Optimization and simulation for robust railway rolling-stock planning. J. Rail Transp. Plan. Manag. 7 (1-2) (2017)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Math. Program. 158 (1-2) (2016)
Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion
Robust optimal sizing of a hybrid energy stand-alone system. Eur. J. Oper. Res. 254 (2) (2016)
Alain Billionnet, Sourour Elloumi, Aurélie Le Maître
Optimal Migration Planning of Telecommunication Equipment. MCO (1) (2015)
Alain Billionnet, Fethi Jarray, Ghassen Tlig, Ezzeddine Zagrouba
A Tabu Approach for Reconstructing Non-Interior Holes Binary Images. IWCIA (Special Track on Applications) (2015)
Alain Billionnet, Fethi Jarray, Ghassen Tlig, Ezzeddine Zagrouba
Reconstruction of Bicolored Images. IWCIA (2015)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation. J. Comb. Optim. 28 (2) (2014)
Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion
2-stage robust MILP with continuous recourse variables. Discret. Appl. Math. 170 (2014)
Alain Billionnet, Fethi Jarray, Ghassen Tlig, Ezzeddine Zagrouba
Reconstructing Convex Matrices by Integer Programming Approaches. J. Math. Model. Algorithms Oper. Res. 12 (4) (2013)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
An efficient compact quadratic convex reformulation for general integer quadratic programs. Comput. Optim. Appl. 54 (1) (2013)
Alain Billionnet
Mathematical optimization ideas for biodiversity conservation. Eur. J. Oper. Res. 231 (3) (2013)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
Extending the QCR method to general mixed-integer programs. Math. Program. 131 (1-2) (2012)
Alain Billionnet
Optimal selection of forest patches using integer and fractional programming. Oper. Res. 10 (1) (2010)
Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. Discret. Appl. Math. 157 (6) (2009)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
Linear Reformulations of Integer Quadratic Programs. MCO (2008)
Alain Billionnet
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming. IEEE Trans. Reliab. 57 (3) (2008)
Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau
Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations. RAIRO Oper. Res. 42 (2) (2008)
Alain Billionnet, Sourour Elloumi
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. Math. Program. 109 (1) (2007)
Alain Billionnet, Karima Djebali
Solution of a fractional combinatorial optimization problem by mixed integer programming. RAIRO Oper. Res. 40 (2) (2006)
Alain Billionnet, Sourour Elloumi, Leila Grouz Djerbi
Designing radio-mobile access networks based on synchronous digital hierarchy rings. Comput. Oper. Res. 32 (2005)
Marie-Christine Costa, Alain Billionnet
Multiway Cut and Integer Flow Problems in Trees. CTW (2004)
Marie-Christine Costa, Alain Billionnet
Multiway cut and integer flow problems in trees. Electron. Notes Discret. Math. 17 (2004)
Alain Billionnet
Mixed integer programming for the 0-1 maximum probability model. Eur. J. Oper. Res. 156 (1) (2004)
Alain Billionnet, Éric Soutif
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 157 (3) (2004)
Alain Billionnet, Éric Soutif
Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem. INFORMS J. Comput. 16 (2) (2004)
Alain Billionnet
Using Integer Programming to Solve the Train-Platforming Problem. Transp. Sci. 37 (2) (2003)
Alain Billionnet
Minimising total average cycle stock subject to practical constraints. J. Oper. Res. Soc. 54 (4) (2003)
Alain Billionnet
Approximation algorithms for fractional knapsack problems. Oper. Res. Lett. 30 (5) (2002)
Xavier Castellani, Hong Jiang, Alain Billionnet
Method for the analysis and design of class characteristic migrations during object system evolution. Inf. Syst. 26 (4) (2001)
Alain Billionnet, Sourour Elloumi
Best reduction of the quadratic semi-assignment problem. Discret. Appl. Math. 109 (3) (2001)
Alain Billionnet, Alain Faye, Éric Soutif
A new upper bound for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 112 (3) (1999)
Alain Billionnet
Integer programming to schedule a hierarchical workforce with variable demands. Eur. J. Oper. Res. 114 (1) (1999)
Alain Billionnet, Alain Faye
A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. Discret. Appl. Math. 74 (2) (1997)
Alain Billionnet, Frédéric Roupin
Linear programming to approximate quadratic 0-1 maximization problems. ACM Southeast Regional Conference (1997)
Alain Billionnet, Sourour Elloumi
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program. J. Parallel Distributed Comput. 26 (2) (1995)
Alain Billionnet, Marie-Christine Costa
Solving the Uncapacited Plant Location Problem on Trees. Discret. Appl. Math. 49 (1-3) (1994)
Alain Billionnet
Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs. IEEE Trans. Parallel Distributed Syst. 5 (4) (1994)
Alain Billionnet
Partitioning Multiple-Chain-Like Task Across a Host-Satellite System. Inf. Process. Lett. 48 (5) (1993)
Alain Billionnet, Alain Sutter
An efficient algorithm for the 3-satisfiability problem. Oper. Res. Lett. 12 (1) (1992)
Alain Billionnet, Marie-Christine Costa, Alain Sutter
An Efficient Algorithm for a Task Allocation Problem. J. ACM 39 (3) (1992)
Alain Billionnet, Alain Sutter
Persistency in quadratic 0-1 optimization. Math. Program. 54 (1992)
Warren E. Adams, Alain Billionnet, Alain Sutter
Unconstrained 0-1 optimization and Lagrangean relaxation. Discret. Appl. Math. 29 (2-3) (1990)
Alain Billionnet, Michel Minoux
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions. Discret. Appl. Math. 12 (1) (1985)
Alain Billionnet
An upper bound on the size of the largest cliques in a graph. J. Graph Theory 5 (2) (1981)