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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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