Alain Billionnet
According to our database1,
Alain Billionnet
authored at least 44 papers
between 1981 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on ensiie.fr
On csauthors.net:
Bibliography
2017
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
Eur. J. Oper. Res., 2016
2015
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
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
2013
J. Math. Model. Algorithms Oper. Res., 2013
Eur. J. Oper. Res., 2013
An efficient compact quadratic convex reformulation for general integer quadratic programs.
Comput. Optim. Appl., 2013
2012
2010
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
IEEE Trans. Reliab., 2008
Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations.
RAIRO Oper. Res., 2008
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
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
Eur. J. Oper. Res., 2004
Electron. Notes Discret. Math., 2004
2003
J. Oper. Res. Soc., 2003
2002
2001
Method for the analysis and design of class characteristic migrations during object system evolution.
Inf. Syst., 2001
1999
Eur. J. Oper. Res., 1999
1997
Discret. Appl. Math., 1997
Proceedings of the 35th Annual Southeast Regional Conference, 1997
1995
J. Parallel Distributed Comput., 1995
1994
Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs.
IEEE Trans. Parallel Distributed Syst., 1994
1993
Inf. Process. Lett., 1993
1992
1990
1985
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions.
Discret. Appl. Math., 1985
1981