An Algorithm for Finding the K-Best Allocations of a Tree Structured Program. - Alain Billionnet; Sourour Elloumi (J. Parallel Distributed Comput., 1995)

Decomposition and Linearization for 0-1 Quadratic Programming. - Sourour Elloumi; Alain Faye; Éric Soutif (Ann. Oper. Res., 2000)

Best reduction of the quadratic semi-assignment problem. - Alain Billionnet; Sourour Elloumi (Discret. Appl. Math., 2001)

Local optimization of index assignments for multiple description coding. - Jean Cardinal; Sourour Elloumi; Martine Labbé (EUSIPCO, 2002)

A New Formulation and Resolution Method for the p-Center Problem. - Sourour Elloumi; Martine Labbé; Yves Pochet (INFORMS J. Comput., 2004)

Designing radio-mobile access networks based on synchronous digital hierarchy rings. - Alain Billionnet; Sourour Elloumi; Leila Grouz Djerbi (Comput. Oper. Res., 2005)

Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. - Alain Billionnet; Sourour Elloumi (Math. Program., 2007)

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

Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. - Julie Christophe; Sophie Dewez; Jean-Paul Doignon; Gilles Fasbender; Philippe Grégoire; David Huygens; Martine Labbé; Sourour Elloumi; Hadrien Mélot; Hande Yaman (Networks, 2008)

Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations. - Alain Billionnet; Sourour Elloumi; Marie-Christine Plateau (RAIRO Oper. Res., 2008)

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. - Alain Billionnet; Sourour Elloumi; Marie-Christine Plateau (Discret. Appl. Math., 2009)

A computational study for the p-median Problem. - Sourour Elloumi; Agnès Plateau (Electron. Notes Discret. Math., 2010)

A tighter formulation of the p-median problem. - Sourour Elloumi (J. Comb. Optim., 2010)

Star p-hub center problem and star p-hub median problem with bounded path lengths. - Hande Yaman; Sourour Elloumi (Comput. Oper. Res., 2012)

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)

Does network coding improve the throughput of a survivable multicast network ? - Sourour Elloumi; Éric Gourdin; Thibaut Lefebvre (DRCN, 2014)

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)

Optimal Migration Planning of Telecommunication Equipment. - Alain Billionnet; Sourour Elloumi; Aurélie Le Maître (MCO (1), 2015)

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)

Optimization of wireless sensor networks deployment with coverage and connectivity constraints. - Sourour Elloumi; Olivier Hudry; Estel Marie; Agnès Plateau; Stephane Rovedakis (CoDIT, 2017)

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)

Optimization and simulation for robust railway rolling-stock planning. - Sabine Tréfond; Alain Billionnet; Sourour Elloumi; Housni Djellab; O. Guyon (J. Rail Transp. Plan. Manag., 2017)

Compact MILP Formulations for the p-Center Problem. - Zacharie Alès; Sourour Elloumi (ISCO, 2018)

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)

Optimization of wireless sensor networks deployment with coverage and connectivity constraints. - Sourour Elloumi; Olivier Hudry; Estel Marie; Agathe Martin; Agnès Plateau; Stéphane Rovedakis (Ann. Oper. Res., 2021)

Models and algorithms for the product pricing with single-minded customers requesting bundles. - Victor Bucarey; Sourour Elloumi; Martine Labbé; Fränk Plein (Comput. Oper. Res., 2021)

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

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

Optimizing Variational Circuits for Higher-Order Binary Optimization. - Zoé Verchère; Sourour Elloumi; Andrea Simonetto (QCE, 2023)

Minimizing recovery cost of network optimization problems. - Zacharie Alès; Sourour Elloumi (Networks, 2023)

Efficient linear reformulations for binary polynomial optimization problems. - Sourour Elloumi; Zoé Verchère (Comput. Oper. Res., 2023)

An efficient benders decomposition for the p-median problem. - Cristian Duran-Mateluna; Zacharie Alès; Sourour Elloumi (Eur. J. Oper. Res., 2023)

Robust MILP formulations for the two-stage weighted vertex p-center problem. - Cristian Duran-Mateluna; Zacharie Alès; Sourour Elloumi; Natalia Jorquera-Bravo (Comput. Oper. Res., 2023)

Fair Energy Allocation for Collective Self-consumption. - Natalia Jorquera-Bravo; Sourour Elloumi; Safia Kedad-Sidhoum; Agnès Plateau (ISCO, 2024)

A rounding and clustering-based exact algorithm for the p-center problem. - Zacharie Alès; Cristian Duran-Mateluna; Sourour Elloumi (Comput. Oper. Res., 2025)

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