( en | de | ru )

 

Disambiguation of "Billionnet, Alain"

Author of the publication

copydeleteadd this publication to your clipboard
Method for the analysis and design of class characteristic migrations during object system evolution.

, , and . Inf. Syst., 26 (4): 237-257 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alain Schifferli

Alain Durocher

Alain Lory

Alain Schlichting

Alain Villard

 

Other publications of authors with the same name

Solving the Uncapacited Plant Location Problem on Trees., and . Discret. Appl. Math., 49 (1-3): 51-59 (1994)Best reduction of the quadratic semi-assignment problem., and . Discret. Appl. Math., 109 (3): 197-213 (2001)Extending the QCR method to general mixed-integer programs., , and . Math. Program., 131 (1-2): 381-401 (2012)Optimal Migration Planning of Telecommunication Equipment., , and . MCO (1), volume 359 of Advances in Intelligent Systems and Computing, page 69-80. Springer, (2015)Optimization and simulation for robust railway rolling-stock planning., , , , and . J. Rail Transp. Plan. Manag., 7 (1-2): 33-49 (2017)Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations., , and . RAIRO Oper. Res., 42 (2): 103-121 (2008)Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method., , and . Discret. Appl. Math., 157 (6): 1185-1197 (2009)Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming.. IEEE Trans. Reliability, 57 (3): 507-516 (2008)A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation., , and . J. Comb. Optim., 28 (2): 376-399 (2014)Linear Reformulations of Integer Quadratic Programs., , and . MCO, volume 14 of Communications in Computer and Information Science, page 43-51. Springer, (2008)