Sourour Elloumi

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 21

Top Topics

Semidefinite Program

Branch And Bound

Optimization Problems

Global Optimality

Top Venues

Comput. Oper. Res.

Publications

Natalia Jorquera-Bravo, Sourour Elloumi, Safia Kedad-Sidhoum, Agnès Plateau
Fair Energy Allocation for Collective Self-consumption. ISCO (2024)
Cristian Duran-Mateluna, Zacharie Alès, Sourour Elloumi, Natalia Jorquera-Bravo
Robust MILP formulations for the two-stage weighted vertex p-center problem. Comput. Oper. Res. 159 (2023)
Cristian Duran-Mateluna, Zacharie Alès, Sourour Elloumi
An efficient benders decomposition for the p-median problem. Eur. J. Oper. Res. 308 (1) (2023)
Sourour Elloumi, Zoé Verchère
Efficient linear reformulations for binary polynomial optimization problems. Comput. Oper. Res. 155 (2023)
Zoé Verchère, Sourour Elloumi, Andrea Simonetto
Optimizing Variational Circuits for Higher-Order Binary Optimization. QCE (2023)
Zacharie Alès, Sourour Elloumi
Minimizing recovery cost of network optimization problems. Networks 81 (1) (2023)
Yves Crama, Sourour Elloumi, Amélie Lambert, Elisabeth Rodríguez-Heck
Quadratic reformulations for the optimization of pseudo-boolean functions. ISAIM (2022)
Victor Bucarey, Sourour Elloumi, Martine Labbé, Fränk Plein
Models and algorithms for the product pricing with single-minded customers requesting bundles. Comput. Oper. Res. 127 (2021)
Sourour Elloumi, Olivier Hudry, Estel Marie, Agathe Martin, Agnès Plateau, Stéphane Rovedakis
Optimization of wireless sensor networks deployment with coverage and connectivity constraints. Ann. Oper. Res. 298 (1) (2021)
Sourour Elloumi, Amélie Lambert, Arnaud Lazare
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation. J. Glob. Optim. 80 (2) (2021)
Sourour Elloumi, Amélie Lambert, Arnaud Lazare
Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems. CoDIT (2019)
Sourour Elloumi, Amélie Lambert, Arnaud Lazare
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation. CoRR (2019)
Hadrien Godard, Sourour Elloumi, Amélie Lambert, Jean Maeght, Manuel Ruiz
Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization. CoRR (2019)
Sourour Elloumi, Amélie Lambert
Global solution of non-convex quadratically constrained quadratic programs. Optim. Methods Softw. 34 (1) (2019)
Hadrien Godard, Sourour Elloumi, Amélie Lambert, Jean Maeght, Manuel Ruiz
Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization. CoDIT (2019)
Zacharie Alès, Sourour Elloumi
Compact MILP Formulations for the p-Center Problem. ISCO (2018)
Sourour Elloumi, Olivier Hudry, Estel Marie, Agnès Plateau, Stephane Rovedakis
Optimization of wireless sensor networks deployment with coverage and connectivity constraints. CoDIT (2017)
Alain Billionnet, Sourour Elloumi, Amélie Lambert, Angelika Wiegele
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. INFORMS J. Comput. 29 (2) (2017)
Sabine Tréfond, Alain Billionnet, Sourour Elloumi, Housni Djellab, O. Guyon
Optimization and simulation for robust railway rolling-stock planning. J. Rail Transp. Plan. Manag. 7 (1-2) (2017)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Math. Program. 158 (1-2) (2016)
Sourour Elloumi, Amélie Lambert
Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem. COCOA (2016)
Alain Billionnet, Sourour Elloumi, Aurélie Le Maître
Optimal Migration Planning of Telecommunication Equipment. MCO (1) (2015)
Sourour Elloumi, Éric Gourdin, Thibaut Lefebvre
Does network coding improve the throughput of a survivable multicast network ? DRCN (2014)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation. J. Comb. Optim. 28 (2) (2014)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
An efficient compact quadratic convex reformulation for general integer quadratic programs. Comput. Optim. Appl. 54 (1) (2013)
Hande Yaman, Sourour Elloumi
Star p-hub center problem and star p-hub median problem with bounded path lengths. Comput. Oper. Res. 39 (11) (2012)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
Extending the QCR method to general mixed-integer programs. Math. Program. 131 (1-2) (2012)
Sourour Elloumi
-median problem. J. Comb. Optim. 19 (1) (2010)
Sourour Elloumi, Agnès Plateau
A computational study for the p-median Problem. Electron. Notes Discret. Math. 36 (2010)
Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. Discret. Appl. Math. 157 (6) (2009)
Alain Billionnet, Sourour Elloumi, Amélie Lambert
Linear Reformulations of Integer Quadratic Programs. MCO (2008)
Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman
to uncover optimal relationships. Networks 52 (4) (2008)
Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau
Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations. RAIRO Oper. Res. 42 (2) (2008)
Alain Billionnet, Sourour Elloumi
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. Math. Program. 109 (1) (2007)
Alain Billionnet, Sourour Elloumi, Leila Grouz Djerbi
Designing radio-mobile access networks based on synchronous digital hierarchy rings. Comput. Oper. Res. 32 (2005)
Sourour Elloumi, Martine Labbé, Yves Pochet
A New Formulation and Resolution Method for the p-Center Problem. INFORMS J. Comput. 16 (1) (2004)
Jean Cardinal, Sourour Elloumi, Martine Labbé
Local optimization of index assignments for multiple description coding. EUSIPCO (2002)
Alain Billionnet, Sourour Elloumi
Best reduction of the quadratic semi-assignment problem. Discret. Appl. Math. 109 (3) (2001)
Sourour Elloumi, Alain Faye, Éric Soutif
Decomposition and Linearization for 0-1 Quadratic Programming. Ann. Oper. Res. 99 (1-4) (2000)
Alain Billionnet, Sourour Elloumi
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program. J. Parallel Distributed Comput. 26 (2) (1995)