Lambert

Amélie Lambert

Maître de conférences (HDR)
Équipe : Optimisation combinatoire
Site web : http://cedric.cnam.fr/~lamberta
Téléphone : +33 1 58 80 85 14
Bureau : 31.1.83

MCF en informatique dans l'équipe OC du laboratoire Cedric-Cnam, je travaille principalement sur la résolution de problèmes d'optimisation non linéaires.

2024

Articles de revue

  1. Lambert, A. A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem. In Computers and Operations Research, 166: 106626, 2024. doi  www 
  1. Alès, Z.; Huré, V. and Lambert, A. New optimization models for optimal classification trees. In Computers and Operations Research, 164: 106515, 2024. doi  www 
  1. Elloumi, S.; Lambert, A.; Neveu, B. and Trombettoni, G. Global solution of Quadratic Problems by Interval Methods and Convex Relaxations. In Journal of Global Optimization, 2024. www 

Non publié

  1. Ales, Z.; Huré, V. and Lambert, A. Clustering data for the Optimal Classication Tree Problem. , working paper or preprint. www 
  1. Lambert, A. and Porumbel, D. C. Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs. , working paper or preprint. www 

2023

Articles de revue

  1. Lambert, A. Using general triangle inequalities within Quadratic Convex Reformulation method. In Optimization Methods and Software, 38 (3): 626-653, 2023. doi  www 

Articles de conférence

  1. Lambert, A. and Porumbel, D. C. Sous-estimateurs Quadratiques convexes par morceaux pour les problèmes d'optimisation quadratique. In 24ème congrès annuel ROADEF, Rennes, France, 2023. www 
  1. Lambert, A. and Porumbel, D. C. A piecewise-quadratic convexification for exactly solving box-constrained quadratic programs. In WCGO 2023 - The 2023 World Congress on Global Optimization, Athens, Greece, 2023. www 

2022

Articles de conférence

  1. Crama, Y.; Elloumi, S.; Lambert, A. and Rodriguez-Heck, E. Quadratic reformulations for the optimization of pseudo-boolean functions. In International Symposium on Artificial Intelligence and Mathematics ISAIM 2022, Fort Lauderdale, United States, 2022. www 
  1. Alès, Z.; Huré, V. and Lambert, A. New optimization models for optimal classification trees. In 32nd European Conference on Operational Research (EURO 2022), Espoo, Finland, 2022. www 
  1. Elloumi, S.; Lambert, A.; Neveu, B. and Trombettoni, G. Global Solution of Quadratic Problems by Interval Methods and Convex Reformulation. In HUGO 2022 - 15th Workshop on Global Optimization, Szeged, Hungary, 2022. www 
  1. Lambert, A. Exact solution of the OPF problem based on compact quadratically constrained convex relaxation. In 32nd European Conference on Operational Research (EURO 2022), Espoo, Finland, 2022. www 
  1. Alès, Z.; Huré, V. and Lambert, A. Modélisations d'arbres de décision optimaux. In 23ème congrès annuel de la société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision (ROADEF 22), Lyon, France, 2022. www 

Non publié

  1. Crama, Y.; Elloumi, S.; Lambert, A. and Rodriguez-Heck, E. Quadratization and convexification in polynomial binary optimization. , working paper or preprint. www 

2021

Articles de revue

  1. Elloumi, S.; Lambert, A. and Lazare, A. Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation. In Journal of Global Optimization, 80 (2): 231-248, 2021. doi  www 
  1. Furini, F.; Lambert, A.; Létocart, L.; Liberti, L. and Traversi, E. Preface: CTW 2018. In Discrete Applied Mathematics, 296: 1, 2021. doi  www 
  1. Chen, Z.; Fampa, M.; Lambert, A. and Lee, J. Mixing convex-optimization bounds for maximum-entropy sampling. In Mathematical Programming, 188: 539-568, 2021. doi  www 

Thèses et habilitations

  1. Lambert, A. Exact solutions of polynomial programs through quadratic convex reformulations: theory and applications. Ph.D. Thesis, Conservatoire National des Arts et Métiers, 2021.

Logiciel

  1. Lambert, A. General mixed-integer quadratically constrained problem instances. www 
  1. Lambert, A. General mixed-integer quadratic problem instances. www 
  1. Lambert, A. k-cluster or densest subgraph problem instances. www 
  1. Lambert, A. Solver of Mixed-Integer Quadratic Programs (SMIQP). www 

2019

Articles de revue

  1. Elloumi, S. and Lambert, A. Global solution of non-convex quadratically constrained quadratic programs. In Optimization Methods and Software, 34 (1): 98-114, 2019. doi  www 

Articles de conférence

  1. Lambert, A.; Elloumi, S.; Lazare, A. and Rodriguez-Heck, E. The Impact of Quadratization in Convexification-Based Resolution of Polynomial Binary Optimization. In PGMO days, Palaiseau, France, 2019. www 
  1. Elloumi, S.; Lambert, A. and Lazare, A. Quadratisation et reformulation convexe pour les polyn^omes de variables binaires. In ROADEF 2019, Le Havre, France, 2019. www 
  1. Lambert, A.; Elloumi, S.; Godard, H.; Maeght, J. and Ruiz, M. Solving Alternative Current Optimal Power Flow to Global Optimality with Quadratic Reformulation Using Semi-Definite Programming and Branch-and-Bound. In PGMO days, Palaiseau, France, 2019. www 
  1. Godard, H.; Elloumi, S.; Lambert, A.; Maeght, J. and Ruiz, M. Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization. In 6th International Conference on Control, Decision and Information Technologies (CoDIT), Paris, France, 2019. doi  www 
  1. Elloumi, S.; Lambert, A. and Lazare, A. Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems. In 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), pages 1498-1503, IEEE, Paris, France, 2019. doi  www 

2018

Articles de conférence

  1. Lambert, A.; Elloumi, S. and Lazare, A. Unconstrained 0-1 polynomial optimization through convex quadratic reformulation. In ISMP 18, Bordeaux, France, 2018. www 
  1. Lambert, A. Valid inequalities for QCQPs. In ISMP 18, Bordeaux, France, 2018. www 
  1. Lambert, A.; Elloumi, S.; Godard, H.; Maeght, J. and Ruiz, M. Solve Alternative Current Optimal Power Flow to global optimality. In ISMP 18, bordeaux, France, 2018. www 
  1. Lambert, A.; Elloumi, S. and Lazare, A. Résolution du problème de suites binaires avec faible autocorrélation `a l'aide d'une reformulation quadratique convexe. In ROADEF 2018, Lorient, France, 2018. www 

2017

Articles de revue

  1. Billionnet, A.; Elloumi, S.; Lambert, A. and Wiegele, A. Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. In INFORMS Journal on Computing, 29 (2): 318-331, 2017. doi  www 

Livres

  1. Delacroix, J.; Barthélemy, F. c.; Fournier, R.; Gil-Michalon, I.; Lambert, A.; Plateau, A.; Rovedakis, S.; Simonot, M.; Thion, V. and Waymel, E. Informatique. Dunod, Fluoresciences , 2017. www 

Articles de conférence

  1. Elloumi, S.; Lambert, A. and Lazare, A. Global optimisation of binary polynomial programs. In PGMO Days, Palaiseau, France, 2017. www 
  1. Lambert, A. and Elloumi, S. Quadratic convex reformulation for partitioning problems. In EUROPT 17, Montreal, Canada, 2017. www 
  1. Gladkikh, E.; Lambert, A.; Faye, A.; Watel, D. and Costa, M-C. Optimisation du maillage électrique du parc éoliennes off-shore -- projet Stationis. In ROADEF 17, Metz, France, 2017. www 
  1. Elloumi, S.; Godard, H.; Lambert, A.; Maeght, J. and Ruiz, M. Solving Optimal Power Flow through reformulation. In 15th EUROPT Workshop on Advances in Continuous Optimization, montréal, Canada, 2017. www 
  1. d'Ambrosio, C.; Elloumi, S.; Lambert, A. and Lazare, A. Optimisation de programmes polynomiaux en variables 0-1 et sans contraintes. In ROADEF 17, Metz, France, 2017. www 
  1. Godard, H.; Elloumi, S.; Lambert, A.; Maeght, J. and Ruiz, M. Reformulation Quadratique Convexe Pour l'Optimisation des Flux de Puissance. In ROADEF 17, Metz, France, 2017. www 

2016

Articles de revue

  1. Billionnet, A.; Elloumi, S. and Lambert, A. Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. In Mathematical Programming, 158 (1-2): 235-266, 2016. doi  www 

Articles de conférence

  1. Elloumi, S. and Lambert, A. Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem. In cocoa 2016, pages 726-734, Hong Kong, China, Lecture Notes in Computer Science, Combinatorial Optimization and Applications. COCOA 2016 10043, 2016. doi  www 
  1. Lambert, A.; Elloumi, S.; d'Ambrosio, C. and Lazare, A. Global solution of mixed-integer polynomial optimization problems through quadratic reformulation. In PGMO days, Palaiseau, France, 2016. www 
  1. Elloumi, S. and Lambert, A. Reformulation quadratique convexe du problème d'affectation quadratique. In ROADEF 2016, Compiègne, France, 2016. www 

2015

Articles de conférence

  1. Lambert, A.; Elloumi, S. and Billionnet, A. Global Solution of General Quadratic Programs. In ISMP 15, Pittsburg, United States, 2015. www 

2014

Articles de revue

  1. Billionnet, A.; Elloumi, S. and Lambert, A. A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation. In Journal of Combinatorial Optimization, 28 (2): 376-399, 2014. doi  www 

Articles de conférence

  1. Elloumi, S. and Lambert, A. Recent advances in solving some optimization problems in graphs by quadratic programming. In Ninth International Colloquium on Graphs and Optimization. GO IX, pages 1, X, Italy, 2014. www 

2013

Articles de revue

  1. Billionnet, A.; Elloumi, S. and Lambert, A. An efficient compact quadratic convex reformulation for general integer quadratic programs. In Computational Optimization and Applications, 54: 141-162, 2013. www 

Articles de conférence

  1. Elloumi, S. and Lambert, A. Quadratic convex reformulation for graph partitionning problems. In IFIP TC 7 / 2013 System Modelling and Optimization, pages 1, Klagenfurt, Austria, 2013. www 
  1. Elloumi, S.; Billionnet, A. and Lambert, A. Global solution of mixed-integer quadratic programs through quadratic convex reformulation. In EURO XXVI, pages 91, ROME, Italy, 2013. www 
  1. Billionnet, A.; Elloumi, S. and Lambert, A. Convex reformulations of mixed-integer quadratically constrained programs. In EUROPT 2013, pages 24, Florence, Italy, 2013. www 

2012

Articles de revue

  1. Billionnet, A.; Elloumi, S. and Lambert, A. Extending the QCR method to the case of general mixed integer programs. In Mathematical Programming Computation, 131: 381-401, 2012. www 

Articles de conférence

  1. Billionnet, A.; Elloumi, S. and Lambert, A. Convex reformulations of Integer Quadratically Constrained Problems. In ISMP (21th International Symposium of Mathematical programming), pages 1 page, Berlin, Germany, 2012. www 
  1. Billionnet, A.; Elloumi, S. and Lambert, A. A new Branch and Bound algorithm for MIQPs. In EURO 2012, pages 57, Vilnius, Liechtenstein, 2012. www 

2011

Articles de conférence

  1. Billionnet, A.; Elloumi, S. and Lambert, A. A solution method for quadratically constrained integer problems. In Optimization 2011, Lisbon, Portugal., pages 64, X, France, 2011. www 

2010

Articles de conférence

  1. Billionnet, A.; Elloumi, S. and Lambert, A. Solving a general mixed-integer quadratic problem through convex reformulation : a computational study. In EWMINLP, Marseille, France, 2010. www 
  1. Billionnet, A.; Elloumi, S. and Lambert, A. Reformulation convexe des programmes quadratiques entiers : un algorithme de Branch and Bound fondé sur la structure du problème reformulé. In ROADEF 10, 11?me congr?s annuel de la Soci?t? fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, pages 2 pages, Toulouse, France, 2010. www 

Divers

  1. Billionnet, A.; Elloumi, S. and Lambert, A. Solving a general mixed-integer quadratic problem through convex reformulation : a computational study. , Poster. www 

2009

Articles de conférence

  1. Billionnet, A.; Elloumi, S. and Lambert, A. Convex reformulations for binary quadratic programs. In EURO 2009, 23rd European Conference on Operational Research, pages 47, Bonn, Germany, 2009. www 
  1. Billionnet, A.; Elloumi, S. and Lambert, A. Résolution de programmes quadratiques en nombres entiers par reformulation convexe. In JPOC 6 (Journ?es Poly?dres et Optimisation Combinatoire), pages 15-18, Bordeaux, France, 2009. www 
  1. Billionnet, A.; Elloumi, S. and Lambert, A. Convex reformulations for integer quadratic programs. In 20th International Symposium of Mathematical programming (ISMP), pages 115, Chicago, United States, 2009. www 

Thèses et habilitations

  1. Lambert, A. Résolution de programmes quadratiques en nombres entiers. Ph.D. Thesis, Conservatoire National des Arts et Métiers (CNAM), 2009.

2008

Articles de conférence

  1. Billionnet, A.; Elloumi, S. and Lambert, A. Comparaison de reformulations linéaires de programmes quadratiques en nombres entiers. In ROADEF'08, 9?me Congr?s de la Soci?t? Fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, pages 71-72, Clermont-Ferrand, France, 2008. www 
  1. Billionnet, A.; Elloumi, S. and Lambert, A. Linear Reformulations of Integer Quadratic Programs. In MCO'08, 2nd international conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, pages 43-51, Metz, France, LNCS , 2008. www 
Haut