| Branching and bounds tighteningtechniques for non-convex MINLP P Belotti, J Lee, L Liberti, F Margot, A Wächter Optimization Methods & Software 24 (4-5), 597-634, 2009 | 884 | 2009 |
| Euclidean distance geometry and applications L Liberti, C Lavor, N Maculan, A Mucherino SIAM review 56 (1), 3-69, 2014 | 725 | 2014 |
| Surrogate‐based methods for black‐box optimization KK Vu, C d'Ambrosio, Y Hamadi, L Liberti International Transactions in Operational Research 24 (3), 393-424, 2017 | 218 | 2017 |
| Global optimization: from theory to implementation L Liberti, N Maculan Springer Science & Business Media, 2006 | 218 | 2006 |
| The discretizable molecular distance geometry problem C Lavor, L Liberti, N Maculan, A Mucherino Computational Optimization and Applications 52 (1), 115-146, 2012 | 214 | 2012 |
| A branch‐and‐prune algorithm for the molecular distance geometry problem L Liberti, C Lavor, N Maculan International Transactions in Operational Research 15 (1), 1-17, 2008 | 214 | 2008 |
| Column generation algorithms for exact modularity maximization in networks D Aloise, S Cafieri, G Caporossi, P Hansen, S Perron, L Liberti Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 82 (4 …, 2010 | 188 | 2010 |
| Distance geometry: theory, methods, and applications A Mucherino, C Lavor, L Liberti, N Maculan Springer Science & Business Media, 2012 | 187 | 2012 |
| Bidirectional A ∗ Search for Time-Dependent Fast Paths G Nannicini, D Delling, L Liberti, D Schultes International Workshop on Experimental and Efficient Algorithms, 334-346, 2008 | 174 | 2008 |
| An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms L Liberti, CC Pantelides Journal of Global Optimization 36 (2), 161-189, 2006 | 172 | 2006 |
| An improved column generation algorithm for minimum sum-of-squares clustering D Aloise, P Hansen, L Liberti Mathematical Programming 131 (1), 195-220, 2012 | 159 | 2012 |
| Bidirectional A* search on time‐dependent road networks G Nannicini, D Delling, D Schultes, L Liberti Networks 59 (2), 240-251, 2012 | 155 | 2012 |
| QPLIB: a library of quadratic programming instances F Furini, E Traversi, P Belotti, A Frangioni, A Gleixner, N Gould, L Liberti, ... Mathematical Programming Computation 11 (2), 237-265, 2019 | 154 | 2019 |
| Molecular distance geometry methods: from continuous to discrete L Liberti, C Lavor, A Mucherino, N Maculan International Transactions in Operational Research 18 (1), 33-51, 2011 | 150 | 2011 |
| Comparison of deterministic and stochastic approaches to global optimization L Liberti, S Kucherenko International Transactions in Operational Research 12 (3), 263-285, 2005 | 139 | 2005 |
| Euclidean distance geometry L Liberti, C Lavor An Introduction, 2017 | 137 | 2017 |
| The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances C Lavor, L Liberti, A Mucherino Journal of Global Optimization 56 (3), 855-871, 2013 | 128 | 2013 |
| Reformulations in mathematical programming: A computational approach L Liberti, S Cafieri, F Tarissan Foundations of Computational Intelligence Volume 3: Global Optimization, 153-234, 2009 | 125 | 2009 |
| Convex envelopes of monomials of odd degree L Liberti, CC Pantelides Journal of Global Optimization 25 (2), 157-168, 2003 | 112 | 2003 |
| Introduction to global optimization L Liberti Ecole Polytechnique 1, 1-43, 2008 | 111 | 2008 |
Carlile LavorFull Professor (Applied Math. Dep.), University of Campinas (UNICAMP)Verified email at ime.unicamp.br
