Lauréate du 2ème prix Robert Faure 2022 délivré par la société savante de Recherche Opérationnelle et d'Aide à la Décision (ROADEF) tous les 3 ans pour récompenser trois jeunes chercheurs de la discipline.
A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem Computers \& Operations Research 166-106626 (2024) In press. DOI: 10.1016/j.cor.2024.106626
New optimization models for optimal classification trees Computers \& Operations Research 164-106515 (2024) In press. (with Z. Alès and V. Huré) DOI: 10.1016/j.cor.2023.106515
Global solution of Quadratic Problems by Interval Methods and Convex Relaxations Journal of Global Optimization (2024) In press. (with S. Elloumi, B. Neveu and G. Trombettoni) DOI: 10.1007/s10898-024-01370-8
Using general triangle inequalities within Quadratic Convex Reformulation method Optimization Methods and Software. 38 (3), pp.626-653 (2023) DOI: 10.1080/10556788.2022.2157002
Mixing convex-optimization bounds for maximum-entropy sampling Mathematical Programming. 188, 539-568 (2021) (with Z. Chen, J. Lee and M. Fampa) DOI: 10.1007/s10107-020-01588-w
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation Journal of Global Optimization (2021) (with S. Elloumi and A. Lazare) DOI: 10.1007/s10898-020-00972-2
Global solution of non-convex quadratically constrained quadratic programs Optimization Methods and Software. 34 (1): 98-114, (2019) (with S. Elloumi) DOI: 10.1080/10556788.2017.1350675
Using a conic bundle method to accelerate both phases of a quadratic convex reformulation Informs Journal on computing. 29 (2), 318-331 (2017) (with A. Billionnet, S. Elloumi and A. Wiegele) DOI: 10.1287/ijoc.2016.0731
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems Mathematical Programming. 158 (1), 235-266 (2016) (with A. Billionnet and S. Elloumi) DOI: 10.1007/s10107-015-0921-2
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation Journal of Combinatorial Optimization. 28(2), 376-399 (2015) (with A. Billionnet and S. Elloumi) DOI: 10.1007/s10878-012-9560-1
An efficient Compact Quadratic Convex Reformulation for general integer quadratic programs Computational Optimization and Applications. 54(1), 141-162 (2013) (with A. Billionnet and S. Elloumi) DOI: 10.1007/s10589-012-9474-y
Extending the QCR method to the case of general mixed integer program Mathematical Programming. 131(1), 381-401 (2012) (with A. Billionnet and S. Elloumi) DOI: 10.1007/s10107-010-0381-7
A piecewise-quadratic convexification for exactly solving box-constrained quadratic programs. WCGO 2023 - The 2023 World Congress on Global Optimization, Jul 2023, Athens, Greece. (with D. C. Porumbel) https://hal.science/hal-04101939 .
Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization 6th International Conference on Control, Decision and Information Technologies (CoDIT). Paris, pp. 1227-1232, IEEE (2019) - (with S. Elloumi, H. Godard, J. Maeght and M. Ruiz) DOI: 10.1109/CoDIT.2019.8820584
Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems 6th International Conference on Control, Decision and Information Technologies (CoDIT). Paris, pp 1498-1503, IEEE (2019) - (with S. Elloumi and A. Lazare) DOI: 10.1109/CoDIT.2019.8820690
Comparison of Quadratic Convex Reformulations to solve the Quadratic Assignment Problem Chan TH., Li M., Wang L. (eds) Combinatorial Optimization and Applications (COCOA 2016). Hong-Kong, December 15-18, vol 10043. LNCS, Springer, Cham (2016) - (with S. Elloumi) DOI: 10.1007/978-3-319-48749-6_54
Linear Reformulations of Integer Quadratic Programs MCO 2008, Metz, september 8-10. 43-51 (2008) - (with A. Billionnet and S. Elloumi) DOI: 10.1007/978-3-540-87477-5_5
Global Solution of Quadratic Problems by Interval Methods and Convex Reformulation XV Workshop on Global Optimization 2022 (HUGO 2022), Szeged, Hungary, (2022) (with S. Elloumi, B. Neveu, and G. Trombettoni)
Exact solution of the OPF problem based on compact quadratically constrained convex relaxation 32nd European Conference on Operational Research (EURO 2022), (2022)
New optimization models for optimal classification trees 32nd European Conference on Operational Research (EURO 2022), (2022) (with Z. Alès and V. Huré)
Quadratic reformulations for the optimization of pseudo-boolean functions International Symposium on Artificial Intelligence and Mathematics Fort Lauderdale, (2022) (with Y. Crama, S. Elloumi and E. Rodriguez-Heck)
The Impact of Quadratization in Convexification-Based Resolution of Polynomial Binary Optimization. PGMO Days., Palaiseau, (2019) (with S. Elloumi, S, A.Lazare, and E. Rodriguez-Heck)
Solving Alternative Current Optimal Power Flow to Global Optimality with Quadratic Reformulation Using Semi-Definite Programming and Branch-and-Bound. PGMO Days, Palaiseau, (2019) (with S. Elloumi, H. Godard, J. Maeght and M. Ruiz)
Valid inequalities for QCQPs. 23th International Symposium of Mathematical programming (ISMP 18). Bordeaux (2018)
Unconstrained 0-1 polynomial optimization through convex quadratic reformulation. 23th International Symposium of Mathematical programming (ISMP 18). Bordeaux (2018) (with S. Elloumi and S, A.Lazare)
Solve Alternative Current Optimal Power Flow to global optimality. 23th International Symposium of Mathematical programming (ISMP 18). Bordeaux (2018) (with S. Elloumi, H. Godard, J. Maeght and M. Ruiz)
Global optimisation of binary polynomial programs PGMO Days., Palaiseau, (2017) (with S. Elloumi and A. Lazare)
Solve Optimal Power Flow through reformulation 15th EUROPT Workshop on Advances in Continuous Optimization ( EUROPT 2017)., July 2017, Montreal, Canada (2017) (with H. Godard, S. Elloumi, J. Maeght and M. Ruiz)
Quadratic convex reformulation for partitioning problems 15th EUROPT Workshop on Advances in Continuous Optimization ( EUROPT 2017)., July 2017, Montreal, Canada (2017) (with S. Elloumi)
Global solution of mixed-integer polynomial optimization problems through quadratic reformulation PGMO days. Palaiseau, (2016) (with S. Elloumi, S, C. D'Ambrosio and A. Lazare)
Global Solution of General Quadratic Programs 22th International Symposium of Mathematical programming (ISMP 15). Pittsburgh, (2015) (with S. Elloumi)
Recent advances in solving some optimization problems in graphs by quadratic programming 9th International Colloquium on Graphs and Optimization (GO IX). Italy (2014) (with S. Elloumi)
Quadratic convex reformulation for graph partitioning problems 26th IFIP TC7 Conference 2013 on System Modelling and Optimization. Klagenfurt (2013) (with S. Elloumi)
Global solution of mixed-integer quadratic programs through quadratic convex reformulation 25th European Conference on Operational Research (EURO 2013). pp.91, Rome (2013) (with A. Billionnet and S. Elloumi)
Convex reformulations of mixed-integer quadratically constrained programs 11th EUROPT Workshop on Advances in Continuous Optimization ( EUROPT 2013). vol. 1, pp.24, Florence (2013) (with A. Billionnet and S. Elloumi)
A new Branch and Bound algorithm for MIQPs EURO 2012. Vilnius, Lithuania, July 8-11, (2012) (with A. Billionnet and S. Elloumi)
Convex reformulations of Integer Quadratically Constrained Problems ISMP (21th International Symposium of Mathematical programming). Berlin, Germany, august 19-24, (2012) (with A. Billionnet and S. Elloumi)
Solving a general mixed-integer quadratic problem through convex reformulation: a computational study European Workshop on Mixed Integer Nonlinear Programming. Marseille, 197-204 (2010) (with A. Billionnet and S. Elloumi)
Solution of the Generalized quadratic Assignment Problem through quadratic convex reformulation EURO 2010. Lisbon (2010) (with A. Billionnet and S. Elloumi)
A solution method for quadratically constrained integer problems Optimization 2011. Lisbon, (2011) (with A. Billionnet and S. Elloumi)
Convex reformulation for binary Quadratic Programs EURO 2009. Bonn, July 05-08 (2009) (with A. Billionnet and S. Elloumi)
Convex reformulation for Integer Quadratic Programs ISMP (20th International Symposium of Mathematical programming). Chicago, USA august 23-28 (2009) (with A. Billionnet and S. Elloumi)
Modélisations d'arbres de décision optimaux 23ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 22). Lyon (2022) (with Z. Alès and V. Huré)
Quadratisation and reformulation convexe pour les polynômes de variables binaires 20ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 19). Le Havre (2019) (with S. Elloumi and A. Lazare)
Résolution du problème de suites binaires with faible autocorrélation à l'aide d'une reformulation quadratique convexe 19ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 18). Lorient (2018) (with S. Elloumi and A. Lazare)
Optimisation de programmes polynômiaux en variables 0-1 et sans contraintes 18ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 17). Metz (2017) (with C. D'ambrosio, S. Elloumi and A. Lazare)
Optimisation du maillage électrique du parc éoliennes off-shore - projet Stationis 18ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 17). Metz (2017) (with M.-C. Costa, A. Faye, E. Gladkih, and D. Watel)
Reformulation Quadratique Convexe Pour l'Optimisation des Flux de Puissance 18ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 17). Metz (2017) (with H. Godard, S. Elloumi, J. Maeght and M. Ruiz)
Reformulation quadratique convexe du problème d'affectation quadratique 17ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 16). Compiègne (2016) (with S. Elloumi)
Reformulation convexe des programmes quadratiques entiers: un algorithme de Branch and Bound fondé sur la structure du problème reformulé 11ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 10). Toulouse (2010) (with A. Billionnet and S. Elloumi)
Résolution de programmes quadratiques en nombres entiers par reformulation convexe JPOC 6. Bordeaux (2009) (with A. Billionnet and S. Elloumi)
Comparaison de reformulations linéaires de programmes quadratiques en nombres entiers 9ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 08). Clermont-Ferrand (2008) (with A. Billionnet and S. Elloumi)
Exact solutions of polynomial programs through quadratic convex reformulations: theory and applications. Habilitation à Diriger des Rechreches. Conservatoire national des arts et métiers, Paris, France, (2021) HDR
Résolution de programmes quadratiques en nombres entiers. PhD thesis, Conservatoire national des arts et métiers, Paris, France, (2009). Thèse
Optimisation en nombres entiers de fonctions quadratiques non convexes soumises à des contraintes linéaires. Master thesis, Université Pierre et Marie Curie, Paris 6, (2006). Rapport de Master Recherche
Algorithmique de graphes . chapitre d'un livre intitulé "INFORMATIQUE" dans la collection Fluoresciences de l'éditeur DUNOD. En couleur et très illustr&ecute;e cette collection à vocation pédagogique et de niveau L1 fait le pont entre le lycée et l'universitée. (with A. Plateau for the chapter, and Joëlle Delacroix, François Barthélemy, Raphaël Fournier, Isabelle Gil-Michalon, Stephane Rovedakis, Marianne Simonot, Virginie Thion, and Emmanuel Waymel for the book).
Preface: special issue 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2018) Discrete Applide Mathematics} 296: 1 (2021) (avec F. Furini, L. Létocart, L. Liberti, E. Traversi) DOI 10.1016/j.dam.2021.03.022
Vous trouverez la liste de mes publications mises à jour ici| Au CNAM | |
| amelie.lambert.(@).cnam.fr | |
| Telephone | (+33) 1 58 80 85 14 |
| Bureau | 2, rue Conté 1er étage Bureau 31 - 1 - 83 75003 PARIS France |
| Adresse courrier | CNAM CEDRIC 292 rue saint Martin F-75141 Paris Cedex 03 France |