Alain Billionnet

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