Alain Billionnet

According to our database1, Alain Billionnet authored at least 44 papers between 1981 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Optimization and simulation for robust railway rolling-stock planning.
J. Rail Transp. Plan. Manag., 2017

Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation.
INFORMS J. Comput., 2017

2016
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems.
Math. Program., 2016

Robust optimal sizing of a hybrid energy stand-alone system.
Eur. J. Oper. Res., 2016

2015
Optimal Migration Planning of Telecommunication Equipment.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

A Tabu Approach for Reconstructing Non-Interior Holes Binary Images.
Proceedings of the Methods and Applications in Image Analysis, 2015

Reconstruction of Bicolored Images.
Proceedings of the Combinatorial Image Analysis - 17th International Workshop, 2015

2014
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation.
J. Comb. Optim., 2014

2-stage robust MILP with continuous recourse variables.
Discret. Appl. Math., 2014

2013
Reconstructing Convex Matrices by Integer Programming Approaches.
J. Math. Model. Algorithms Oper. Res., 2013

Mathematical optimization ideas for biodiversity conservation.
Eur. J. Oper. Res., 2013

An efficient compact quadratic convex reformulation for general integer quadratic programs.
Comput. Optim. Appl., 2013

2012
Extending the QCR method to general mixed-integer programs.
Math. Program., 2012

2010
Optimal selection of forest patches using integer and fractional programming.
Oper. Res., 2010

2009
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method.
Discret. Appl. Math., 2009

2008
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming.
IEEE Trans. Reliab., 2008

Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations.
RAIRO Oper. Res., 2008

Linear Reformulations of Integer Quadratic Programs.
Proceedings of the Modelling, 2008

2007
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem.
Math. Program., 2007

2006
Solution of a fractional combinatorial optimization problem by mixed integer programming.
RAIRO Oper. Res., 2006

2005
Designing radio-mobile access networks based on synchronous digital hierarchy rings.
Comput. Oper. Res., 2005

2004
Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem.
INFORMS J. Comput., 2004

An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem.
Eur. J. Oper. Res., 2004

Mixed integer programming for the 0-1 maximum probability model.
Eur. J. Oper. Res., 2004

Multiway cut and integer flow problems in trees.
Electron. Notes Discret. Math., 2004

2003
Using Integer Programming to Solve the Train-Platforming Problem.
Transp. Sci., 2003

Minimising total average cycle stock subject to practical constraints.
J. Oper. Res. Soc., 2003

2002
Approximation algorithms for fractional knapsack problems.
Oper. Res. Lett., 2002

2001
Method for the analysis and design of class characteristic migrations during object system evolution.
Inf. Syst., 2001

Best reduction of the quadratic semi-assignment problem.
Discret. Appl. Math., 2001

1999
A new upper bound for the 0-1 quadratic knapsack problem.
Eur. J. Oper. Res., 1999

Integer programming to schedule a hierarchical workforce with variable demands.
Eur. J. Oper. Res., 1999

1997
A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem.
Discret. Appl. Math., 1997

Linear programming to approximate quadratic 0-1 maximization problems.
Proceedings of the 35th Annual Southeast Regional Conference, 1997

1995
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program.
J. Parallel Distributed Comput., 1995

1994
Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs.
IEEE Trans. Parallel Distributed Syst., 1994

Solving the Uncapacited Plant Location Problem on Trees.
Discret. Appl. Math., 1994

1993
Partitioning Multiple-Chain-Like Task Across a Host-Satellite System.
Inf. Process. Lett., 1993

1992
An efficient algorithm for the 3-satisfiability problem.
Oper. Res. Lett., 1992

Persistency in quadratic 0-1 optimization.
Math. Program., 1992

An Efficient Algorithm for a Task Allocation Problem.
J. ACM, 1992

1990
Unconstrained 0-1 optimization and Lagrangean relaxation.
Discret. Appl. Math., 1990

1985
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions.
Discret. Appl. Math., 1985

1981
An upper bound on the size of the largest cliques in a graph.
J. Graph Theory, 1981


  Loading...