| Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem A Billionnet, S Elloumi Mathematical programming 109, 55-68, 2007 | 240 | 2007 |
| 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 | 231 | 2004 |
| 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 | 161 | 2009 |
| Extending the QCR method to general mixed-integer programs A Billionnet, S Elloumi, A Lambert Mathematical programming 131 (1), 381-401, 2012 | 131 | 2012 |
| 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 | 108 | 2012 |
| A tighter formulation of the p-median problem S Elloumi Journal of combinatorial optimization 19 (1), 69-83, 2010 | 70 | 2010 |
| Exact quadratic convex reformulations of mixed-integer quadratically constrained problems A Billionnet, S Elloumi, A Lambert Mathematical Programming 158 (1), 235-266, 2016 | 50 | 2016 |
| Best reduction of the quadratic semi-assignment problem A Billionnet, S Elloumi Discrete Applied Mathematics 109 (3), 197-213, 2001 | 50 | 2001 |
| 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 | 44 | 2005 |
| Global solution of non-convex quadratically constrained quadratic programs S Elloumi, A Lambert Optimization methods and software 34 (1), 98-114, 2019 | 35 | 2019 |
| Linear reformulations of integer quadratic programs A Billionnet, S Elloumi, A Lambert International Conference on Modelling, Computation and Optimization in …, 2008 | 32 | 2008 |
| 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 | 29 | 2008 |
| 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 | 27 | 2013 |
| Decomposition and linearization for 0-1 quadratic programming S Elloumi, A Faye, E Soutif Annals of Operations Research 99 (1), 79-93, 2000 | 26 | 2000 |
| 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 | 23 | 2008 |
| Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation S Elloumi, A Lambert, A Lazare Journal of Global Optimization 80 (2), 231-248, 2021 | 22 | 2021 |
| Optimization and simulation for robust railway rolling-stock planning S Tréfond, A Billionnet, S Elloumi, H Djellab, O Guyon Journal of Rail Transport Planning & Management 7 (1-2), 33-49, 2017 | 22 | 2017 |
| 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 | 22 | 2017 |
| Optimization of wireless sensor networks deployment with coverage and connectivity constraints S Elloumi, O Hudry, E Marie, A Martin, A Plateau, S Rovedakis Annals of Operations Research 298, 183-206, 2021 | 18 | 2021 |
| Comparison of different lower bounds for the constrained module allocation problem S Elloumi, F Roupin, E Soutif CEDRIC Lab/CNAM, 2003 | 16 | 2003 |
Amélie LambertAssistant professor, CEDRIC-Cnam在 cnam.fr 的电子邮件经过验证
