| Extending the QCR method to general mixed-integer programs A Billionnet, S Elloumi, A Lambert Mathematical programming 131 (1), 381-401, 2012 | 134 | 2012 |
| Exact quadratic convex reformulations of mixed-integer quadratically constrained problems A Billionnet, S Elloumi, A Lambert Mathematical Programming 158 (1), 235-266, 2016 | 53 | 2016 |
| Global solution of non-convex quadratically constrained quadratic programs S Elloumi, A Lambert Optimization Methods and Software 34 (1), 98-114, 2019 | 43 | 2019 |
| Linear reformulations of integer quadratic programs A Billionnet, S Elloumi, A Lambert Modelling, Computation and Optimization in Information Systems and …, 2008 | 33 | 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 | 28 | 2013 |
| 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 | 25 | 2021 |
| 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 | 21 | 2017 |
| Novel approach towards global optimality of optimal power flow using quadratic convex optimization H Godard, S Elloumi, A Lambert, J Maeght, M Ruiz 2019 6th International Conference on Control, Decision and Information …, 2019 | 14 | 2019 |
| Mixing convex-optimization bounds for maximum-entropy sampling Z Chen, M Fampa, A Lambert, J Lee Mathematical Programming 188 (2), 539-568, 2021 | 13 | 2021 |
| A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation A Billionnet, S Elloumi, A Lambert Journal of Combinatorial Optimization 28 (2), 376-399, 2014 | 13 | 2014 |
| New optimization models for optimal classification trees Z Alès, V Huré, A Lambert Computers & Operations Research 164, 106515, 2024 | 8 | 2024 |
| Convex reformulations of integer quadratically constrained problems A Billionnet, S Elloumi, A Lambert ISMP (21th International Symposium of Mathematical programming), 1 page, 2012 | 6 | 2012 |
| A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem A Lambert Computers & Operations Research 166, 106626, 2024 | 4 | 2024 |
| Résolution de programmes quadratiques en nombres entiers A Lambert Conservatoire National des Arts et Métiers (CNAM), 2009 | 4 | 2009 |
| Quadratization and convexification in polynomial binary optimization Y Crama, S Elloumi, A Lambert, E Rodriguez-Heck | 3 | 2022 |
| Global solution of quadratic problems using interval methods and convex relaxations S Elloumi, A Lambert, B Neveu, G Trombettoni Journal of Global Optimization, 1-23, 2024 | 2 | 2024 |
| Using general triangle inequalities within quadratic convex reformulation method A Lambert Optimization Methods and Software 38 (3), 626-653, 2023 | 2 | 2023 |
| Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems S Elloumi, A Lambert, A Lazare 2019 6th International Conference on Control, Decision and Information …, 2019 | 2 | 2019 |
| Exact solutions of polynomial programs through quadratic convex reformulations: theory and applications A Lambert Conservatoire National des Arts et Métiers, 2021 | 1 | 2021 |
| Informatique J Delacroix, E Waymel, F Barthélémy, R Fournier-S'niehotta, ... Dunod, 2017 | 1 | 2017 |
Sourour ElloumiProfessor at ENSTA ParisTech and CEDRIC, FranceE-mailová adresa ověřena na: cnam.fr
