Sourour Elloumi
Sourour Elloumi
Professor at ENSTA ParisTech and CEDRIC, France
Adresse e-mail validée de cnam.fr
Titre
Citée par
Citée par
Année
Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem
A Billionnet, S Elloumi
Mathematical Programming 109 (1), 55-68, 2007
2012007
A new formulation and resolution method for the p-center problem
S Elloumi, M Labbé, Y Pochet
INFORMS Journal on Computing 16 (1), 84-94, 2004
1652004
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
A Billionnet, S Elloumi, MC Plateau
Discrete Applied Mathematics 157 (6), 1185-1197, 2009
1452009
Extending the QCR method to general mixed-integer programs
A Billionnet, S Elloumi, A Lambert
Mathematical programming 131 (1), 381-401, 2012
1052012
Star p-hub center problem and star p-hub median problem with bounded path lengths
H Yaman, S Elloumi
Computers & Operations Research 39 (11), 2725-2732, 2012
852012
A tighter formulation of the p-median problem
S Elloumi
Journal of combinatorial optimization 19 (1), 69-83, 2010
492010
Designing radio-mobile access networks based on synchronous digital hierarchy rings
A Billionnet, S Elloumi, LG Djerbi
Computers & operations research 32 (2), 379-394, 2005
422005
Best reduction of the quadratic semi-assignment problem
A Billionnet, S Elloumi
Discrete Applied Mathematics 109 (3), 197-213, 2001
392001
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
A Billionnet, S Elloumi, A Lambert
Mathematical Programming 158 (1), 235-266, 2016
372016
An efficient compact quadratic convex reformulation for general integer quadratic programs
A Billionnet, S Elloumi, A Lambert
Computational Optimization and Applications 54 (1), 141-162, 2013
232013
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
J Christophe, S Dewez, JP Doignon, G Fasbender, P Grégoire, ...
Networks: An International Journal 52 (4), 287-298, 2008
232008
Quadratic 0-1 programming: tightening linear or quadratic convex reformulation by use of relaxations
A Billionnet, S Elloumi, MC Plateau
RAIRO-Operations Research-Recherche Opérationnelle 42 (2), 103-121, 2008
232008
Decomposition and linearization for 0-1 quadratic programming
S Elloumi, A Faye, E Soutif
Annals of Operations Research 99 (1), 79-93, 2000
222000
Linear reformulations of integer quadratic programs
A Billionnet, S Elloumi, A Lambert
International Conference on Modelling, Computation and Optimization in …, 2008
202008
Using a Conic Bundle method to accelerate both phases of a Quadratic Convex Reformulation
A Billionnet, S Elloumi, A Lambert, A Wiegele
INFORMS Journal on Computing 29 (2), 318-331, 2017
142017
Global solution of non-convex quadratically constrained quadratic programs
S Elloumi, A Lambert
Optimization Methods and Software 34 (1), 98-114, 2019
132019
Convex quadratic programming for exact solution of 0-1 quadratic programs
A Billionnet, S Elloumi, MC Plateau
RAIRO-Operations Research, 2005
132005
Comparison of different lower bounds for the constrained module allocation problem
S Elloumi, F Roupin, E Soutif
CEDRIC Lab/CNAM, 2003
132003
Eigenvalue methods for linearly constrained quadratic 0-1 problems with application to the densest k-subgraph problem
MC Plateau, A Billionnet, S Elloumi
ROADEF 05, février, Tours, 55-66, 2005
122005
An algorithm for finding the k-best allocations of a tree structured program
A Billionnet, S Elloumi
Journal of Parallel and Distributed Computing 26 (2), 225-232, 1995
121995
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20