Global solution of quadratic problems using interval methods and convex relaxations. - Elloumi, Sourour; Lambert, Amélie; Neveu, Bertrand; Trombettoni, Gilles (J. Glob. Optim., 2025)

New optimization models for optimal classification trees. - Alès, Zacharie; Huré, Valentine; Lambert, Amélie (Comput. Oper. Res., 2024)

A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem. - Lambert, Amélie (Comput. Oper. Res., 2024)

Using general triangle inequalities within quadratic convex reformulation method. - Lambert, Amélie (Optim. Methods Softw., 2023)

Quadratic reformulations for the optimization of pseudo-boolean functions. - Crama, Yves; Elloumi, Sourour; Lambert, Amélie; Rodríguez-Heck, Elisabeth (2022)

Exact solutions of polynomial programs through quadratic convex reformulations: theory and applications. - Lambert, Amélie (2021)

Preface: CTW 2018. - Furini, Fabio; Lambert, Amélie; Létocart, Lucas; Liberti, Leo; Traversi, Emiliano (Discret. Appl. Math., 2021)

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation. - Elloumi, Sourour; Lambert, Amélie; Lazare, Arnaud (J. Glob. Optim., 2021)

Mixing convex-optimization bounds for maximum-entropy sampling. - Chen, Zhongzhu; Fampa, Marcia; Lambert, Amélie; Lee, Jon (Math. Program., 2021)

Global solution of non-convex quadratically constrained quadratic programs. - Elloumi, Sourour; Lambert, Amélie (Optim. Methods Softw., 2019)

Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization. - Godard, Hadrien; Elloumi, Sourour; Lambert, Amélie; Maeght, Jean; Ruiz, Manuel (2019)

Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems. - Elloumi, Sourour; Lambert, Amélie; Lazare, Arnaud (2019)

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation. - Elloumi, Sourour; Lambert, Amélie; Lazare, Arnaud (CoRR, 2019)

Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization. - Godard, Hadrien; Elloumi, Sourour; Lambert, Amélie; Maeght, Jean; Ruiz, Manuel (CoRR, 2019)

Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. - Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika (INFORMS J. Comput., 2017)

Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. - Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie (Math. Program., 2016)

Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem. - Elloumi, Sourour; Lambert, Amélie (2016)

A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation. - Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie (J. Comb. Optim., 2014)

An efficient compact quadratic convex reformulation for general integer quadratic programs. - Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie (Comput. Optim. Appl., 2013)

Extending the QCR method to general mixed-integer programs. - Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie (Math. Program., 2012)

Résolution de programmes quadratiques en nombres entiers. (Solution of integer quadratic programs). - Lambert, Amélie (2009)

Linear Reformulations of Integer Quadratic Programs. - Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie (2008)