Leo Liberti

Publications

Mathematics

Current (accepted) work

• [XDLV] Liding Xu, Claudia D'Ambrosio, Leo Liberti, Sonia Vanier, Cutting planes for signomial programming, SIAM Journal on Optimization, accepted.
• [RLMM] Wagner Da Rocha, Leo Liberti, Antonio Mucherino, Thérèse Malliavin, Influence of Stereochemistry in a Local Approach for Calculating Protein Conformations, Journal of Chemical Information and Modeling, accepted.
• [Lb] Leo Liberti, Unassigned distance geometry and the Buckminsterfullerene, AIRO-ODS 2024, accepted.
• [La] Leo Liberti, Decoding noisy messages: a method that just shouldn't work, in Antoine Deza, Swati Gupta, Sebastian Pokutta (eds.), Data Science and Optimization, Communications Series on Data Science and Optimization, Fields Institute, Toronto, accepted.
• [XL] Liding Xu, Leo Liberti, Submodular maximization and its generalization through an intersection cut lens, Mathematical Programming B, online first.

2024

• [AALLM24] Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino, An impossible combinatorial counting method in distance geometry, Discrete Applied Mathematics, 354:83-93, 2024.
• [BBL24] Nabil Moncef Boukhatem, Davide Buscaldi, Leo Liberti, On syntactical graphs-of-words, in A. Brieden et al. (eds.), Graphs and Combinatorial Optimization: from Theory to Applications. Proceedings of the 19th Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization 2023, Springer, Cham, 2024.

2023

• [DKL23] Diego Delle Donne, Mathieu Kowalski, Leo Liberti, A novel integer linear programming approach for global ell0 minimization, Journal of Machine Learning Research, 24:1-28, 2023.
• [LMP23] Leo Liberti, Benedetto Manca, Pierre-Louis Poirion, Random projections for linear programming: An improved retrieval phase, ACM Journal of Experimental Algorithmics, 28(2.2):1-33, 2023.
• [BSSLD23] Pedro Borges, Claudia Sagastizábal, Michail Solodov, Leo Liberti, Claudia D'Ambrosio, Profit sharing mechanisms in multi-owned cascaded hydrosystems, Optimization and Engineering, 24:2005-2043, 2023.
• [RLLM23] Wagner Da Rocha, Carlile Lavor, Leo Liberti, Thérèse Malliavin, Pseudo-dihedral angles in proteins providing a new description of the Ramachandran map, in F. Nielsen and F. Barbaresco (eds.), Geometric Science of Information (GSI), LNCS 14072:511-519, Springer, Berlin, 2023.
• [LILM23] Leo Liberti, Gabriele Iommazzo, Carlile Lavor, Nelson Maculan, Cycle-based formulations in Distance Geometry, Open Journal of Mathematical Optimization, 4:a1/16p, 2023.
• [BBL23] Nabil Boukhatem, Davide Buscaldi, Leo Liberti, Empirical comparison of semantic similarity measures for technical question answering, in Silvia Chiusano et al. (eds.), Proceedings of the 26th European Conference on Advances in Databases and Information Systems (ADBIS22), CCIS 1652:167-177, Springer, Cham, 2023.
• [LMPO23] Leo Liberti, Benedetto Manca, Antoine Oustry, Pierre-Louis Poirion, Random Projections for Semidefinite Programming, in Paola Cappanera et al. (eds.), Optimization and Decision Science: Operations Research, Inclusion and Equity, AIRO Series 9:97-108, Springer, Cham, 2023.
• [OLCDL23] Antoine Oustry, Marion Le Tilly, Thomas Clausen, Claudia D'Ambrosio, Leo Liberti, Optimal deployment of indoor wireless local area networks, Networks, 81:23-50, 2023.
• [KGL23] Sammy Khalife, Douglas Gonçalves, Leo Liberti, Distance geometry for word representations and applications, Journal of Computational Mathematics and Data Science, 6:100073, 2023.

2022

• [CODL22] Martina Cerulli, Antoine Oustry, Claudia D'Ambrosio, Leo Liberti, Convergent algorithms for a class of convex semi-infinite programs, SIAM Journal of Optimization, 32(4):2493-2526, 2022.
• [ODLR22] Antoine Oustry, Claudia D'Ambrosio, Leo Liberti, Manuel Ruiz, Certified and accurate SDP bounds for the ACOPF problem, Electric Power Systems Research (issue dedicated to the Power Systems Computation Conference --- PSCC22), 212:108278, 2022.
• [FILMLM22] Daniel Förster, Jérôme Idier, Leo Liberti, Antonio Mucherino, Jung-Hsin Lin, Thérèse Malliavin, Low-resolution description of the conformational space for intrinsically disordered proteins, Scientific Reports, 12:19057, 2022.
• [LMPa22] Leo Liberti, Benedetto Manca, Pierre-Louis Poirion, Random Projections for the Distance Geometry Problem, in Marc Noy et al. (eds.), Proceedings of the workshop Discrete Mathematics Days 2020/2022, Universidad de Cantabria, 2022.
• [LMP22] Leo Liberti, Benedetto Manca, Pierre-Louis Poirion, Practical performance of Random Projections in Linear Programming, in Christian Schulz and Bora Uçar (eds.), Proceedings of the 20th International Symposium on Experimental Algorithms (SEA22), LIPICS, art. 21:1-21, Dagstuhl, 2022.
• [BCEL22] Daniel Bienstock, Martina Cerulli, Mauro Escobar, Leo Liberti, Power network design with line activity, in L. Amorosi et al. (eds.), Optimization in Artificial Intelligence and Data Science (Proceedings of AIRO-ODS21), AIRO Series 8:185-198, Springer, Cham, 2022
• [LM22] Leo Liberti, Benedetto Manca, Side-constrained minimum sum-of-squares clustering: Mathematical Programming and random projections, Journal of Global Optimization, 83:83-118, 2022.
• [DLLS22] Phil Duxbury, Carlile Lavor, Leo Liberti, Luiz de Salles-Neto, Unassigned distance geometry and molecular conformation problems, Journal of Global Optimization, 83:73-82, 2022.
• [BCL22] Maurizio Bruglieri, Roberto Cordone, Leo Liberti, Maximum feasible subsystems of distance geometry constraints, Journal of Global Optimization, 83:29-47, 2022.

2021

• [KML21] Sammy Khalife, Thérèse Malliavin, Leo Liberti, Secondary structure assignment of proteins in the absence of sequence information, Bioinformatics Advances, 1(1):1-8, 2021.
• [KGAL21] Sammy Khalife, Douglas Gonçalves, Youssef Allouah, Leo Liberti, Further results on latent discourse models and word embeddings, Journal of Machine Learning Research, 22(270):1-36, 2021.
• [HMLLM21] Simon Hengeveld, Thérèse Malliavin, Jung-Hsin Lin, Leo Liberti, Antonio Mucherino, A study on the impact of the distance types involved in protein structure determination by NMR, Proceedings of BIBM21 (CSBW21 satellite workshop), 2502-2510, 2021.
• [GLLS21] Douglas Gonçalves, Carlile Lavor, Leo Liberti, Michael Souza, A new algorithm for the DMDGP subclass of Distance Geometry problems, Algorithmica, 83:2400-2426, 2021.
• [CDLP21] Martina Cerulli, Claudia D'Ambrosio, Leo Liberti, Mercedes Pelegrin, Detecting and solving aircraft conflicts using bilevel programming, Journal of Global Optimization, 81:529-557, 2021.
• [L21] Leo Liberti, Continuous reformulation of binary variables, revisited, Proceedings of MOTOR21, CCIS 1476, Springer, Cham, 2021.
• [CL21] Martina Cerulli, Leo Liberti, Polynomial programming prevents aircraft (and other) conflicts, Operations Research Letters, 49:447-451, 2021.
• [STLDC21] Ruobing Shen, Bo Tang, Leo Liberti, Claudia D'Ambrosio, Stéphane Canu, Learning Discontinuous Piecewise Affine Fitting Functions using Mixed Integer Programming over Lattice, Journal of Global Optimization, 81:85-108, 2021.
• [LPV21] Leo Liberti, Pierre-Louis Poirion, Ky Vu, Random projections for conic programs, Linear Algebra and its Applications, 626:204-220, 2021.
• [LILM21] Leo Liberti, Gabriele Iommazzo, Carlile Lavor, Nelson Maculan, A cycle-based formulation for the Distance Geometry Problem, in C. Gentile et al. (Eds.), Graphs and Combinatorial Optimization: from Theory to Applications (Proceedings of CTW20), AIRO Springer Series 5:93-106, Springer, Berlin, 2021.
• [DL21] Gustavo Dias, Leo Liberti, Exploiting symmetries in mathematical programming via orbital independence, Annals of Operations Research, 298:149-182, 2021.

2020

• [TML20] Guillaume Thiry, Ioana Manolescu, Leo Liberti, A chatbot for interacting with SDMX databases, in Koubarakis et al. (Eds.), Proceedings of the Natural Language Interfaces for the Web of Data (NLIWOD) satellite workshop of the 19th International Semantic Web Conference (ISWC), p. 24-39, 2020.
• [DFIL20] Claudia D'Ambrosio, Antonio Frangioni, Gabriele Iommazzo, Leo Liberti, A learning-based mathematical programming formulation for the automatic configuration of optimization solvers, in G. Nicosia et al. (Eds.), Proceedings of LOD20, LNCS 12565:700-712 Springer, New York, 2020.
• [MGLLLM20] Antonio Mucherino, Douglas Gonçalves, Leo Liberti, Jung-Hsin Lin, Carlile Lavor, Nelson Maculan, MD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data, in Proceedings of Workshop on Computational Optimization 2020, Annals of Computer Science and Information Systems 21:289-294, 2020.
• [BEGL20] Daniel Bienstock, Mauro Escobar-Santoro, Claudio Gentile, Leo Liberti, Mathematical Programming formulations for the Alternating Current Optimal Power Flow problem, 4OR, 18:249-292, 2020.
• [DLPV20] Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Ky Vu, Random projections for quadratic programs, Mathematical Programming B, 183:619-647, 2020.
• [IDFL20] Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Learning to configure mathematical programming solvers by mathematical programming, in P. Pardalos, M. Brunato (Eds.), Learning and Intelligent Optimization (LION14), LNCS 12096:377-389, Springer, New York, 2020.
• [L20b] Leo Liberti, A new distance geometry method for constructing word and sentence vectors, in J. Tang et al. (Eds.), International Workshop on Deep Learning for Graphs and Structured Data Embedding (DL4G20 --- a satellite workshop of the WWW Conference 2020), Companion Proceedings p. 679-685 ACM, New York, 2020.
• [L20a] Leo Liberti, Distance Geometry and Data Science, TOP, 28:271-339, 2020.
• [CLD20] Martina Cerulli, Leo Liberti, Claudia D'Ambrosio, Flying safely by bilevel programming, in M. Paolucci et al. (Eds.), Advances in Optimization and Decision Science for Society, Services and Enterprises (AIRO-ODS19), AIRO Springer Series 3:197-206, Springer, Cham, 2020.
• [PTDL20] Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Algorithms and applications for a class of bilevel MILPs, Discrete Applied Mathematics, 272:75-89, 2020.
• [AALLM20] Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino, The K-discretization and K-incident graphs for discretizable Distance Geometry, Optimization Letters, 14:469-482, 2020.
• [LL20] Jon Lee, Leo Liberti, On an SDP relaxation for kissing number, Optimization Letters, 14:417–422, 2020.

2019

• [MMLL19] Thérèse Malliavin, Antonio Mucherino, Carlile Lavor, Leo Liberti, Systematic exploration of protein conformational space using a Distance Geometry approach, Journal of Chemical Information and Modeling, 59(10):4486-4503, 2019.
• [KLV19] Sammy Khalife, Leo Liberti, Michalis Vazirgiannis, Geometry and analogies: a study and propagation method for word representation, in Carlos Martin-Vide et al. (eds.), Statistical Language and Speech Processing (Proceedings of SLSP19), Lecture Notes in Artificial Intelligence, 11816:100-111, Springer, New York, 2019.
• [LSCL19] Carlile Lavor, Michael Souza, Luis Carvalho, Leo Liberti, On the polynomiality of finding kDMDGP re-orders, Discrete Applied Mathematics, 267:190-194, 2019.
• [VPDL19] Ky Vu, Pierre-Louis Poirion, Claudia D’Ambrosio, Leo Liberti, Random projections for quadratic programs over a Euclidean ball, in Andrea Lodi et al. (eds.), Integer Programming and Combinatorial Optimization (Proceedings of IPCO 2019), LNCS 11480:442-452, Springer, New York, 2019
• [CLD19] Martina Cerulli, Leo Liberti, Claudia D'Ambrosio, On aircraft deconfliction by bilevel programming, in Johann Hurink et al. (Eds.), Proceedings of CTW19, 2019.
• [IDAL19] Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti Algorithmic configuration by learning and optimization, in Johann Hurink et al. (Eds.), Proceedings of CTW19, 2019.
• [FTBFGGLLMMSVW19] Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans Mittelmann, Nick Sahinidis, Stefan Vigerske, Angelika Wiegele, QPLIB: A library of quadratic programming instances, Mathematical Programming Computation, 11(2):237-265, 2019.
• [ALL19] Jorge Alencar, Carlile Lavor, Leo Liberti Realizing Euclidean distance matrices by sphere intersection, Discrete Applied Mathematics, 256:5-10, 2019.
• [LLDWBMN19] C. Lavor, L. Liberti, B. Donald, B. Worley, B. Bardiaux, T. Malliavin, M. Nilges, Minimal NMR distance information for rigidity of protein graphs, Discrete Applied Mathematics, 256:91-104, 2019.
• [DLLO19] Claudia D'Ambrosio, Jon Lee, Leo Liberti, Maks Ovsjanikov, Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization, Optimization and Engineering, 13(2):337-347, 2019.
• [LLN19] Leo Liberti, Carlile Lavor, Nelson Maculan, A mathematical programming formulation for the Hartree-Fock problem on open-shell systems, Optimization Letters, 13:429-437, 2019.
• [L19] Leo Liberti, Undecidability and Hardness in MINLP, RAIRO Operations Research, 53:81-109, 2019.
• [VPL19] Ky Vu, Pierre-Louis Poirion, Leo Liberti, Gaussian random projections for Euclidean membership problems, Discrete Applied Mathematics, 253:93-102, 2019.

2018

• [VPL18] Vu Khac Ky, Pierre-Louis Poirion, Leo Liberti, Random projections for linear programming, Mathematics of Operations Research, 43(4):1051-1071, 2018.
• [SGL18] Esteban Salgado, Claudio Gentile, Leo Liberti, Perspective cuts for the ACOPF with generators, in P. Daniele, L. Scrimali (eds.), New trends in emerging complex real-life problems, AIRO Springer Series, 1, Springer, New York, 2018.
• [LL18b] Leo Liberti, Carlile Lavor, Open research areas in distance geometry, in A. Migdalas, P. Pardalos (eds.), Open Problems in Optimization and Data Science, SOIA, 14:183-223, Springer, New York, 2018.
• [SSTL18] Esteban Salgado, Andrea Scozzari, Fabio Tardella, Leo Liberti, Alternating current optimal power flow with generator selection, in J. Lee and R. Mahjoub and G. Rinaldi (Eds.), Proceedings of ISCO18, LNCS 10856:364-375, 2018.
• [BDL18] Pierre-Olivier Bauguion, Claudia D’Ambrosio, Leo Liberti, Maximum concurrent flow with incomplete data, in J. Lee and R. Mahjoub and G. Rinaldi (Eds.), Proceedings of ISCO18, LNCS 10856:77-88, 2018.
• [LV18] Leo Liberti, Vu Khac Ky, Barvinok's naive algorithm in distance geometry, Operations Research Letters, 46:476-481, 2018.
• [WDCMBWNLL18] B. Worley, F. Delhommel, F. Cordier, T. Malliavin, B. Bardiaux, N. Wolff, M. Nilges, C. Lavor, L. Liberti, Tuning interval Branch-and-Prune for protein structure determination, Journal of Global Optimization, 72:109-127, 2018.
• [WSKL18] Olivier Wang, Christian de Sainte Marie, Changhai Ke, Leo Liberti, Universality and prediction in business rules, Computational Intelligence, 34:763-785, 2018.
• [FGLLM18] Felipe Fidalgo, Douglas Gonçalves, Carlile Lavor, Leo Liberti, Antonio Mucherino, A symmetry-based splitting strategy for discretizable distance geometry problems, Journal of Global Optimization, 71:717-733, 2018.

2017

• [ADGHLNS17] V. Austel, S. Dash, O. Gunluk, L. Horesh, L. Liberti, G. Nannicini, B. Schieber, Globally optimal symbolic regression, in Symposium on Interpretable ML, Satellite workshop of NIPS, 2017
• [TDLPSS17] Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Schachnai, Complexity and inapproximability results for the power edge set problem, Journal of Combinatorial Optimization, 35(3):895-905, 2017.
• [L17] Leo Liberti, Mathematical programming bounds for kissing numbers, in A. Sforza, C. Sterle (Eds.), Optimization and Decision Science: Methodologies and Applications (AIRO/ODS17), Proceedings in Mathematics and Statistics, 217:213-222, Springer, New York, 2017.
• [FLSW17] Matteo Fischetti, Leo Liberti, Domenico Salvagnin, Toby Walsh, Orbital Shrinking: Theory and Applications, Discrete Applied Mathematics, 222:109-123, 2017.
• [DL17] Claudia D'Ambrosio, Leo Liberti, Distance geometry in linearizable norms, in F. Nielsen and F. Barbaresco (Eds.) Geometric Science of Information, LNCS 10589:830-837, Springer, New York, 2017.
• [LD17] Leo Liberti, Claudia D'Ambrosio, The Isomap algorithm in distance geometry, in C. Iliopoulos et al. (Eds.), Proceedings of the Symposium on Experimental Algorithms, LIPICS, art. 5:1-13, Dagstuhl, 2017.
• [GMLL17] Douglas Gonçalves, Antonio Mucherino, Carlile Lavor, Leo Liberti, Recent advances on the interval distance geometry problem, Journal of Global Optimization, 69:525-545, 2017.
• [WL17] Olivier Wang, Leo Liberti Controlling some statistical properties of business rules programs, in R. Battiti et al. (eds.), Learning and Intelligent Optimization (LION11) LNCS 10556:263-276, Springer, New York, 2017.
• [LLa17] Leo Liberti, Carlile Lavor, Euclidean Distance Geometry: An Introduction, Springer, New York, 2017.
• [LLLM17] Leo Liberti, Carlile Lavor, Weldon Lodwick, Tiago Mendonça da Costa, An Introduction to Distance Geometry applied to Molecular Geometry, Springer, New York, 2017.
• [MSL17] Luca Mencarelli, Youcef Sahraoui, Leo Liberti, A multiplicative weights update algorithm for MINLP, EURO Journal on Computational Optimization, 5(1-2):31-86, 2017.
• [VDHL17] Ky Vu, Claudia D'Ambrosio, Youssef Hamadi, Leo Liberti Surrogate-based methods for black-box optimization, International Transactions in Operational Research, 24(3):393-424, 2017.
• [DVLLM17] Claudia D'Ambrosio, Ky Vu, Carlile Lavor, Leo Liberti, Nelson Maculan, New error measures and methods for realizing protein graphs from distance data, Discrete and Computational Geometry, 57(2):371-418, 2017.

2016

• [PTDL16] Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, The Power Edge Set problem, Networks, 68(2):104-120, 2016.
• [WKLS16] Olivier Wang, Changhai Ke, Leo Liberti, Christian de Sainte-Marie, The learnability of Business Rules, in Proceedings of MOD16, LNCS 10122, 2016.
• [WLDSK16] Olivier Wang, Leo Liberti, Claudia D’Ambrosio, Christian de Sainte-Marie, Changhai Ke, Controlling the average behaviour of business rules programs, in Proceedings of RuleML16, LNCS 9718:68-83, 2016.
• [DLa16] Gustavo Dias, Leo Liberti, New methods for the Distance Geometry Problem, in Proceedings of CTW16, ENDM 55:45-48, 2016.
• [LPV16] Leo Liberti, Pierre-Louis Poirion, Vu Khac Ky, Solving LP using random projections, in Proceedings of CTW16, ENDM 55:53-56, 2016.
• [HL16] Hassan Hijazi, Leo Liberti, Constraint Qualification Failure in Action, Operations Research Letters, 44(4):503-506, 2016.
• [LLS16] Leo Liberti, Carlile Lavor, Grzegorz Swirszcz, Distance geometry on the sphere, in Proceedings of JCDCGG15, LNCS 9943, 2016.
• [DL16b] Gustavo Dias, Leo Liberti, Diagonally dominant programming in distance geometry, in Proceedings of ISCO16, LNCS 9849:225-236, 2016.
• [DLc] Gustavo Dias, Leo Liberti, Distance geometry: too much is never enough, in Proceedings of GOW16, 13-16, Univ. do Minho, Braga, 2016.
• [LL16] Leo Liberti, Carlile Lavor, Six mathematical gems from the history of Distance Geometry, International Transactions in Operational Research, 23:897-920, 2016.
• [CKLZ16] Alberto Costa, Sergey Kushnarev, Leo Liberti, Sun Zeyu, Divisive heuristic for modularity density maximization, Computers and Operations Research, 71:100-109, 2016.

2015

• [TPDL15] Sonia Toubaline, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti, Observing the state of a smart grid using bilevel programming, in Z. Lu et al. (eds.), Proceedings of COCOA15, LNCS 9486:364-376, 2015.
• [DL15] Gustavo Dias, Leo Liberti, Orbital independence in symmetric mathematical programs, in Z. Lu et al. (eds.), Proceedings of COCOA15, LNCS 9486:476-480, 2015.
• [CBBMALNLM15] Andrea Cassioli, Benjamin Bardiaux, Guillaume Bouvier, Antonio Mucherino, Rafael Alves, Leo Liberti, Michael Nilges, Carlile Lavor, Therese Malliavin, An algorithm to enumerate all possible protein conformations verifying a set of distance constraints, BMC Bioinformatics, 16:23, 2015.
• [CGLL15] Andrea Cassioli, Oktay Günlük, Carlile Lavor, Leo Liberti, Discretization vertex orders in distance geometry, Discrete Applied Mathematics, 197:27-41, 2015.
• [DLR15] Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo, Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks, ACM Journal of Experimental Algorithmics, 19:1-29, 2015.
• [LDPT15] Leo Liberti, Claudia D'Ambrosio, Pierre-Louis Poirion, Sonia Toubaline, Measuring smart grids, in Proceedings of the 45th Italian Operations Research Society, 11-20, Pisa, 2015.
• [ABLL15] Jorge Alencar, Tiberius Bonates, Carlile Lavor, Leo Liberti, An algorithm for realizing Euclidean distance matrices, in M. Campelo (ed.), Proceedings of Latin-American Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics 50:(66), 2015.
• [DLM15] Gustavo Dias, Leo Liberti, Nelson Maculan, Modelling rank constraints in mathematical programming, in E. Duman et al. (eds.), Proceedings of the 13th Cologne-Twente Workshop in Graphs and Combinatorial Optimization p.193-196, Istanbul 2015.
• [BHL15] Andrea Bettinelli, Pierre Hansen, Leo Liberti, Community detection with the weighted parsimony criterion, Journal of Systems Science and Complexity, 28(3):517-545 2015.
• [L15] Leo Liberti, Optimization and Sustainable Development, Computational Management Science, 12:371-395, 2015.

2014

• [DLLLS14] Claudia D'Ambrosio, M. Le Ravalec, Leo Liberti, Claire Lizon, Delphine Sinoquet, A mixed-integer nonlinear optimization approach for well placement and geometry, in Proceedings of ECMOR14, Catania, 2014.
• [DKLLM14] Claudia D'Ambrosio, Vu Khac Ky, Carlile Lavor, Leo Liberti, Nelson Maculan, Computational experience on distance geometry problems 2.0, in L. Casado et al. (eds.), Proceedings of the XIII Global Optimization Workshop, 101-104, Malaga, 2014.
• [PTDL14] Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Localization on smart grids, in L. Casado et al. (eds.), Proceedings of the XIII Global Optimization Workshop, 101-104, Malaga, 2014.
• [LO14] Leo Liberti, James Ostrowski, Stabilizer-based symmetry breaking constraints for mathematical programs, Journal of Global Optimization, 60:183-194, 2014.
• [LM14] Leo Liberti, Fabrizio Marinelli, Mathematical Programming: Turing completeness and applications to software analysis, Journal of Combinatorial Optimization, 28:82-104, 2014.
• [LLMM14] Leo Liberti, Carlile Lavor, Nelson Maculan, Antonio Mucherino, Euclidean distance geometry and applications, SIAM Review, 56(1):3-69, 2014.
• [LMLLM14] Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino, On the number of realizations of certain Henneberg graphs arising in protein conformation, Discrete Applied Mathematics, 165:213-232, 2014.
• [FAAHL14] Isaac Fernandes, Daniel Aloise, Dario Aloise, Pierre Hansen, Leo Liberti, On the Weber facility location problem with limited distances and side constraints, Optimization Letters, 8(2):407-424, 2014.
• [CHL14] Sonia Cafieri, Pierre Hansen, Leo Liberti, Improving heuristics for network modularity maximization using an exact algorithm, Discrete Applied Mathematics, 163:65-72, 2014.

2013

• [L13] Leo Liberti, Ottaviano Fabrizio Mossotti (in Italian), in A. Clericuzio, S. Ricci (eds.), Il contributo italiano alla storia del pensiero, Ottava appendice (Scienze), Enciclopedia Italiana, Istituto Treccani, Roma, p. 426-430, 2013.
• [ACHLPR13] Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, Manuel Ruiz, Modularity maximization in networks by Variable Neighbourhood Search, in Bader et al. (eds.), Graph Partitioning and Graph Clustering, Contemporary Mathematics, 588:113:127, AMS, Providence, 2013.
• [LLM13b] Carlile Lavor, Leo Liberti, Antonio Mucherino, The intervalBranch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances, Journal of Global Optimization, 56(3):855-871, 2013.
• [CLMN13] Sonia Cafieri, Leo Liberti, Fréedéric Messine, Bertrand Nogarède, Optimal design of electrical machines: Mathematical Programming formulations, COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, 32(3):977-996, 2013.
• [ADL13] Edoardo Amaldi, Kanika Dhyani, Leo Liberti, A two-phase heuristic for the bottleneck k-hyperplane clustering problem, Computational Optimization and Applications, 56:619:633, 2013.
• [BLRS13] Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey, The anonymous subgraph problem, Computers and Operations Research, 40:973-979, 2013.
• [SMSGLL13] Silas Sallaume, Simone Martins, Luiz Satoru Ochi, Warley Silva Gramacho, Carlile Lavor, Leo Liberti, A discrete search algorithm for finding the structure of protein backbones and side chains, International Journal of Bioinformatics Research and Applications, 9(3):261-270, 2013.
• [MLLM13] Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan (eds.), Distance Geometry: Theory, Methods and Applications, Springer, New York, 2013.
• [LLM13] Leo Liberti, Carlile Lavor, Antonio Mucherino, The discretizable molecular distance geometry problem is easier on proteins, in [MLLM13], 47-60, 2013.
• [BGGL13] Nathanael Beeker, Stéphane Gaubert, Christian Glusa, Leo Liberti, Is the Distance Geometry Problem in NP?, in [MLLM13], 85-93, 2013.
• [CHL13] Alberto Costa, Pierre Hansen, Leo Liberti, On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square, Discrete Applied Mathematics, 161:96-106, 2013.
• [LL13] Leo Liberti, Carlile Lavor, On a relationship between graph realizability and distance matrix completion, in A. Migdalas (ed.), Optimization Theory, Decision Making, and Operations Research Applications, SPMS, 31:39-48, Springer, Berlin, 2013.
• [BCLLM13] Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti, Andrew Miller, On the composition of convex envelopes for quadrilinear terms, in A. Chinchuluun et al. (eds.), Optimization, Simulation and Control, SOIA 76:1-16, Springer, Berlin, 2013.

2012

• [BHL12] Andrea Bettinelli, Pierre Hansen, Leo Liberti, Algorithm for parametric community detection in networks, Physical Review E, 86:016107, 2012.
• [FL12] Matteo Fischetti, Leo Liberti Orbital shrinking, in Mahjoub et al. (eds.) Combinatorial Optimization, LNCS 7422:48-58, 2012.
• [GKLR12] Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda, Technological architecture evolutions of information systems: trade-off and optimization, Concurrent Engineering Research and Applications, 20(2):127-147, 2012.
• [HDKLW12] Hassan Hijazi, Amadou Diallo, Michel Kieffer, Leo Liberti, Claudio Weidmann, A MILP approach for designing robust variable-length codes based on exact free distance computation, Proceedings of the Data Compression Conference (DCC), IEEE, 2012.
• [LL12] Jon Lee, Leo Liberti, A matroid view of key theorems for edge-swapping algorithms, Mathematical Methods of Operations Research, 76:125-127, 2012.
• [DFLL12] Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi, A storm of Feasibility Pumps for nonconvex MINLP, Mathematical Programming B, 136:229-231, 2012.
• [MLL12b] Antonio Mucherino, Carlile Lavor, Leo Liberti, The discretizable distance geometry problem, Optimization Letters, 6(8):1671-1686, 2012.
• [MLL12a] Antonio Mucherino, Carlile Lavor, Leo Liberti, Exploiting symmetry properties of the Discretizable Molecular Distance Geometry Problem, Journal of Bioinformatics and Computational Biology, 10(3):1242009(15), 2012.
• [CHLLFM12] Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine, Compact relaxations for polynomial programming problems, in R. Klasing (Ed.), Experimental Algorithms, LNCS 7276:75-86, Springer, Berlin, 2012.
• [CL12] Alberto Costa, Leo Liberti, Relaxations of multilinear convex envelopes: dual is better than primal, in R. Klasing (Ed.), Experimental Algorithms, LNCS 7276:87-98, Springer, Berlin, 2012.
• [KLW12] Dominik Kirchler, Leo Liberti, Robert Wolfler Calvo, A label correcting algorithm for the shortest path problem on a multi-modal route network, in R. Klasing (Ed.), Experimental Algorithms, LNCS 7276:236-247, Springer, Berlin, 2012.
• [LLMM12] Carlile Lavor, Leo Liberti, Nelson Maculan, Antonio Mucherino, The discretizable molecular distance geometry problem, Computational Optimization and Applications, 52:115-146, 2012.
• [SDL12] Hanif Sherali, Evrim Dalkiran, Leo Liberti, Reduced RLT representations for nonconvex polynomial programming problems, Journal of Global Optimization, 52:447-469, 2012.
• [LLLLMS12] Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko, Discretization orders for distance geometry problems, Optimization Letters, 6:783-796, 2012
• [NDSL12] Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti, Bidirectional A* search on time-dependent road networks, Networks, 59(2):240-251, 2012.
• [LLMM12b] Carlile Lavor, Leo Liberti, Nelson Maculan, Antonio Mucherino, Recent advances on the discretizable molecular distance geometry problem, European Journal of Operational Research, 219:698-706, 2012.
• [L12] Leo Liberti, Reformulations in mathematical programming: Automatic symmetry detection and exploitation, Mathematical Programming A, 131:273-304, 2012.
• [AHL12] Daniel Aloise, Pierre Hansen, Leo Liberti, An improved column generation algorithm for minimum sum-of-squares clustering, Mathematical Programming A, 131:195-220, 2012.
• [LO12] Leo Liberti, Eduardo Ortiz, Ottaviano Fabrizio Mossotti (in Italian), Dizionario Biografico degli Italiani, vol. 77, Istituto della Enciclopedia Italiana, Roma, 2012.
• [L12b] Leo Liberti, Symmetry in Mathematical Programming, in S. Leyffer and J. Lee (eds.), Mixed Integer Nonlinear Programming, IMA Series 154:263-286, Springer, New York, 2012.

2011

• [LMN11] Leo Liberti, Nenad Mladenovic, Giacomo Nannicini, A recipe for finding good solutions to MINLPs, Mathematical Programming Computation, 3:349-390, 2011.
• [CLN11] Gerard Cornuéjols, Leo Liberti, Giacomo Nannicini, Improved strategies for branching on general disjunctions, Mathematical Programming A, 130:225-247, 2011.
• [MLL11] Antonio Mucherino, Carlile Lavor, Leo Liberti, A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry Problem, in Proceedings of Computationl Structural Bioinformatics Workshop, 390-395, IEEE, 2011
• [KLPW11] Dominik Kirchler, Leo Liberti, Thomas Pajor, Roberto Wolfler Calvo, UniALT for regular language constrained shortest paths on a multi-modal transportation network, in Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization and Systems, OpenAccess Series in Informatics, Schloss Dagstuhl, 2011
• [LAP11] Leo Liberti, Laurent Alfandari, Marie-Christine Plateau, Edge cover by connected bipartite subgraphs, Annals of Operations Research, 188(1):307-329, 2011.
• [LLM11] Leo Liberti, Carlile Lavor, Antonio Mucherino, An exponential algorithm for the Discretizable Molecular Distance Geometry Problem is polynomial on proteins, ISBRA 2011 Proceedings (short paper), 2011.
• [IKLA11] Lana Iwaza, Michel Kieffer, Leo Liberti, Khaldoun Al-Agha, Joint decoding of multiple-description network-coded data, in NETCOD 2011 Proceedings, IEEE, 2011
• [RHL11] Fabio Roda, Pierre Hansen, Leo Liberti, The price of equity in the hazmat transportation problem, L. Adacher et al. (eds.), CTW11 Proceedings, 235-238, Università di Roma 3, 2011.
• [CHL11b] Alberto Costa, Pierre Hansen, Leo Liberti, Bound constraints for Point Packing in a Square, in L. Adacher et al. (eds.), CTW11 Proceedings, 126-129, Università di Roma 3, 2011.
• [LMLM11b] Leo Liberti, Benoît Masson, Carlile Lavor, Antonio Mucherino, Branch-and-Prune trees with bounded width, in L. Adacher et al. (eds.), CTW11 Proceedings, 189-193, Università di Roma 3, 2011.
• [LMLLM11] Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino, On the number of solutions of the discretizable molecular distance geometry problem, in Wang, Zhu, Du (eds.), Combinatorial Optimization and Applications, LNCS 6831:322-342, Springer, Berlin, 2011.
• [TBJL11] Nora Touati-Moungla, Pietro Belotti, Vincent Jost, Leo Liberti, A branch-and-price algorithm for the risk-equity constrained routing problem, INOC 2011 Proceedings, in Pahl, Reiners, Voss (eds.), Network Optimization, LNCS 6701:439-449, Springer, Berlin, 2011.
• [NCKL11] Giacomo Nannicini, Gérard Cornuéjols, Miroslav Karamanov, Leo Liberti, Branching on split disjunctions, in V. Chvátal (ed.), Combinatorial Optimization: Methods and Applications, IOS Press, 164-182, 2011.
• [CHL11] Sonia Cafieri, Pierre Hansen, Leo Liberti, A locally optimal heuristic for modularity maximization of networks, Physical Review E, 83:056105(1-8), 2011.
• [LMLM11a] Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan, On the computation of protein backbones by using artificial backbones of hydrogens, Journal of Global Optimization, 50:329-344, 2011.
• [MLMLNM11] Antonio Mucherino, Carlile Lavor, Therese Malliavin, Leo Liberti, Michael Nilges, Nelson Maculan, Influence of pruning devices on the solution of molecular distance geometry problems, in Panos Pardalos and Steffen Rebennack (eds.), Proceedings of the Symposium on Experimental Algorithms, LNCS 6630:206-217, Springer, Heidelberg, 2011.
• [BLLNT11] Pietro Belotti, Leo Liberti, Andrea Lodi, Giacomo Nannicini, Andrea Tramontani, Disjunctive inequalities: applications and extensions, in J. Cochran et al. (eds.), Encyclopedia of Operations Research and Management Science, Wiley, Hoboken, 2011.

2010

• [MLLT10] Antonio Mucherino, Carlile Lavor, Leo Liberti, El-Ghazali Talbi, A parallel version of the Branch & Prune algorithm for the molecular distance geometry problem, in ACS/IEEE International Conference on Computer Systems and Applications, p. 14(1-6), 2010
• [LLM10] Carlile Lavor, Leo Liberti, Antonio Mucherino, On the solution of molecular distance geometry problems with interval data, in Proceedings of the International Workshop on Computational Proteomics (Int. Conf. on Bioinformatics and Biomedicine), IEEE, Hong-Kong, 77-82, 2010.
• [CHLc10] Sonia Cafieri, Pierre Hansen, Leo Liberti, Improving heuristics for network modularity maximization using an exact algorithm, MatHeuristics 2010 Proceedings, Vienna, 2010.
• [BCLL10] Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti, Feasibility-based bounds tightening via fixed points, in W. Wu, O. Daescu (eds.), Combinatorial Optimization and Applications, LNCS 6508:65-76, Springer, Berlin, 2010.
• [LMLM10b] Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan, Discrete approaches for solving molecular distance geometry problems using NMR data, International Journal of Computational Bioscience, 2010:88-94, 2010.
• [CLMN10] Sonia Cafieri, Leo Liberti, Frédéric Messine, Bertrand Nogarède, Discussion about Formulations and Resolution Techniques of Electrical Machine Design Problems, in Proceedings of the XIX International Conference on Electrical Machines, IEEE, Rome, 2010. doi.10.1109/ICELMACH.2010.5607836
• [GLLLM10] Eric Goubault, Stéphane Le Roux, Jeremy Leconte, Leo Liberti, Fabrizio Marinelli, Static analysis by abstract interpretation: a Mathematical Programming approach, in Proceedings of NSAD 2011, Electronic Notes in Theoretical Computer Science, 267:73-87, Elsevier, 2010
• [LLMM10] Leo Liberti, Carlile Lavor, Antonio Mucherino, Nelson Maculan, Molecular distance geometry methods: from continuous to discrete, International Transactions in Operational Research, 18:33-51, 2010.
• [GKLR10] Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda, Optimal technological architecture evolutions of information systems, in M. Aiguier, F. Bretaudeau, D. Krob (eds.), Complex Systems Design and Management, Springer, Berlin, 2010.
• [ACCHPL10] Daniel Aloise, Sonia Cafieri, Gilles Caporossi, Pierre Hansen, Sylvain Perron, Leo Liberti Column generation algorithms for exact modularity maximization in networks, Physical Review E, 82:046112, 2010.
• [LCS10] Leo Liberti, Sonia Cafieri, David Savourey, The Reformulation-Optimization Software Engine, in Komei Fukuda et al., Mathematical Software, LNCS 6327:303-314, Springer, Berlin, 2010.
• [MLL10] Antonio Mucherino, Leo Liberti, Carlile Lavor, MD-jeep: an Implementation of a Branch & Prune algorithm for Distance Geometry Problems, in Komei Fukuda et al., Mathematical Software, LNCS 6327:186-197, Springer, Berlin, 2010.
• [DFLL10b] Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi, On interval subgradient and no-good cuts, Operations Research Letters, 38:341-345, 2010.
• [LLLM10] Leo Liberti, Stephane Le Roux, Jeremy Leconte, Fabrizio Marinelli, Mathematical programming based debugging, ISCO Proceedings, Electronic Notes in Discrete Mathematics 36:1311-1318, Elsevier, 2010.
• [CLH10] Alberto Costa, Leo Liberti, Pierre Hansen, Formulation symmetries in circle packing, ISCO Proceedings, Electronic Notes in Discrete Mathematics 36:1303-1310, Elsevier, 2010.
• [CLL10] Sonia Cafieri, Jon Lee, Leo Liberti, On convex relaxations of quadrilinear terms, Journal of Global Optimization, 47:661-685, 2010.
• [CHL10b] Alberto Costa, Pierre Hansen, Leo Liberti, Static symmetry breaking in circle packing, in U. Faigle, R. Schrader, D. Herrmann (eds.), CTW10 Proceedings, 47-50, Köln, 2010.
• [BCLL10] Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti, On the convergence of feasibility based bounds tightening, in U. Faigle, R. Schrader, D. Herrmann (eds.), CTW10 Proceedings, 21-24, Köln, 2010.
• [DFLL10] Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi, Experiments with a Feasibility Pump approach for nonconvex MINLPs, in P. Festa (ed.), Efficient Algorithms, LNCS 6049:350-360, Springer, Berlin, 2010.
• [CHL10b] Sonia Cafieri, Pierre Hansen, Leo Liberti, Loops and multiple edges in modularity maximization of networks, Physical Review E, 81:046102, 2010.
• [BLMS10] Pierre Bonami, Leo Liberti, Andrew Miller, Annick Sartenaer, Proceedings of the European Workshop on MINLP, Marseille, 2010.
• [NBBKL10] Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti, Fast paths in large-scale dynamic road networks, Computational Optimization and Applications, 45:143-158, 2010.
• [CHL10] Sonia Cafieri, Pierre Hansen, Leo Liberti, Edge ratio and community structure in networks, Physical Review E, 81(2):0261051-14, 2010.

2009

• [LMLNB09] Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan, An artificial backbone of hydrogens for finding the conformation of protein molecules, Proceedings of the Computational Structural Bioinformatics Workshop, IEEE, 152-155, 2009.
• [LMLN09] Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan, Computing artificial backbones of hydrogen atoms in order to discover protein backbones, Proceedings of the International Multiconference on Computer Science and Information Technology, IEEE, 751-756, 2009.
• [MLLM09b] Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan, On the Definition of Artificial Backbones for the Discretizable Molecular Distance Geometry Problem, Mathematica Balkanica, 23:289-302, 2009.
• [CLL09] Sonia Cafieri, Jon Lee, Leo Liberti, Comparison of convex relaxations of quadrilinear terms, in C. Ma, L. Yu, D. Zhang, Z. Zhou (eds.), Global Optimization: Theory, Methods and Applications I, Lecture Notes in Decision Sciences, 12(B):999-1005, Global-Link Publishers, Hong Kong 2009.
• [BLLMW09] Pietro Belotti, Jon Lee, Leo Liberti, François Margot, Andreas Wächter, Branching and bounds tightening techniques for non-convex MINLP, Optimization Methods and Software, 24(4):597-634, 2009.
• [MLLM09] Antonio Mucherino, Leo Liberti, Carlile Lavor, Nelson Maculan, Comparisons between an exact and a meta-heuristic algorithm for the molecular distance geometry problem, GECCO09 Proceedings, ACM, 2009.
• [MDKLM09] Fabrizio Marinelli, Olivier de Weck, Daniel Krob, Leo Liberti, Antonio Mucherino, A General Framework for Combined Module- and Scale-based Product Platform Design, 2nd Int. Symp. Engineering Systems Proceedings, MIT, Boston, 2009.
• [CLN09] Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini, Improved strategies for branching on general disjunctions, CTW09 Proceedings,144-145, Ecole Polytechnique, Paris 2009.
• [RLR09] Fabio Roda, Leo Liberti, Franco Raimondi, Combinatorial optimization based recommender systems, CTW09 Proceedings, 175-179, Ecole Polytechnique, Paris 2009.
• [BLRS09] Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey, The anonymous subgraph problem, CTW09 Proceedings, 269-274, Ecole Polytechnique, Paris 2009.
• [LCT09] Leo Liberti, Sonia Cafieri, Fabien Tarissan, Reformulations in Mathematical Programming: A Computational Approach, in A. Abraham, A.-E. Hassanien, P. Siarry (eds.), Foundations of Computational Intelligence, Vol. 3, Studies in Computational Intelligence series 203:153-234, Springer, New York, 2009.
• [ALMM09] Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan, Edge-swapping algorithms for the minimum fundamental cycle basis problem, Mathematical Methods of Operations Research, 69:205-223, 2009.
• [LLMM09b] Carlile Lavor, Leo Liberti, Antonio Mucherino, Nelson Maculan, On a discretizable subclass of instances of the molecular distance geometry problem, in D. Shin, Proceedings of the Symposium on Applied Computing, p. 804-805, ACM, 2009.
• [LLMN09] Leo Liberti, Carlile Lavor, Nelson Maculan, Marco-Antonio Chaer Nascimento, Reformulation in mathematical programming: an application to quantum chemistry, Discrete Applied Mathematics, 157(6):1309-1318, 2009.
• [BL09] Maurizio Bruglieri, Leo Liberti, Optimally running a biomass-based energy production process, in J. Kallrath, P. Pardalos, S. Rebennack, M. Scheidt (eds.), Optimization in the Energy Industry, Springer, 221-232, 2009.
• [L09] Leo Liberti, Reformulations in Mathematical Programming: Definitions and Systematics, RAIRO-RO, 43(1):55-86, 2009.
• [LLMM09] Leo Liberti, Carlile Lavor, Nelson Maculan, Fabrizio Marinelli, Double Variable Neighbourhood Search with smoothing for the Molecular Distance Geometry Problem, Journal of Global Optimization, 43:207-218, 2009.
• [LMZ09] Leo Liberti, Nelson Maculan, Yue Zhang, Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem, Optimization Letters, 3:109-121, 2009.
• [LNM09] Leo Liberti, Giacomo Nannicini, Nenad Mladenovic, A good recipe for solving MINLPs, in V. Maniezzo, T. Stützle, S. Voss (eds.), Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems 10 2009.

2008

• [TLL08] Fabien Tarissan, Leo Liberti, Camilo La Rota, Biological Regulatory Network reconstruction: a mathematical programming approach, ECCS08 Proceedings, 2008.
• [LTL08] Camilo La Rota, Fabien Tarissan, Leo Liberti, Inferring parameters in Genetic Regulatory Networks, CLAIO08 Proceedings, 2008.
• [DL08] Kanika Dhyani, Leo Liberti, Mathematical programming formulations for the bottleneck Hyperplane Clustering problem, MCO08 Proceedings, Communications in Computer and Information Science 14:87-96, Springer 2008.
• [BL08] Maurizio Bruglieri, Leo Liberti, Optimal running and planning of a biomass-based energy production process, Energy Policy, 36:2430-2438, 2008.
• [LLM08A] Carlile Lavor, Leo Liberti, Nelson Maculan, Molecular distance geometry problem, in P. Pardalos and C. Floudas (eds.), Encyclopedia of Optimization, 2nd Edition, 2305-2311, Springer, Berlin, 2008.
• [SL08] Hanif Sherali, Leo Liberti, Reformulation-Linearization Technique for Global Optimization, in P. Pardalos and C. Floudas (eds.), Encyclopedia of Optimization, 2nd Edition, 3263-3268, Springer, Berlin, 2008.
• [NL08] Giacomo Nannicini, Leo Liberti, Shortest paths in dynamic graphs, International Transactions in Operational Research, 15:551-563, 2008.
• [NBKL08] Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti, Fast Computation of Point-to-Point Paths on Time-dependent Road Networks, COCOA08 Proceedings, LNCS 5165:225-234, Springer, 2008.
• [L08c] Leo Liberti, Automatic generation of symmetry-breaking constraints, in B. Yang, D.-Z. Du and C.A. Wang (eds.) COCOA08 Proceedings, LNCS 5165:328-338, Springer 2008.
• [NDLS08] Giacomo Nannicini, Leo Liberti, Daniel Delling, Dominik Schultes, Bidirectional A* search for time-dependent fast paths, in C.C. McGeoch (ed.) WEA08 Proceedings, LNCS 5038:334-346, Springer 2008.
• [L08b] Leo Liberti, Reformulations in Mathematical Programming: Definitions, in G. Righini (ed.), CTW08 Proceedings, Università di Milano, 66-70, 2008.
• [LR08] Leo Liberti, Franco Raimondi, The Secret Santa problem, in R. Fleischer and J. Xu (eds.) AAIM08 Proceedings, LNCS 5034:271-279, Springer 2008.
• [L08] Leo Liberti, Spherical cuts for Integer Programming problems, International Transactions in Operational Research, 15:283-294, 2008.
• [NBKL08] Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti, Fast computation of Point-to-Point Time-dependent Paths on Dynamic Road Networks with Interval Data, in A. Quillaut, Ph. Mahey (eds.), Proceedings of ROADEF 2008 (Long Papers), Presses Universitaires de l'Université Blaise Pascal, Clermont-Ferrand, 2008.
• [LLM08] Leo Liberti, Carlile Lavor, Nelson Maculan, A branch-and-prune algorithm for the molecular distance geometry problem, International Transactions in Operational Research, 15(1):1-17, 2008.

2007

• [L07B] Leo Liberti, Reformulation Techniques in Mathematical Programming, Thèse d'Habilitation à diriger des Recherches, Université de Paris IX - Dauphine, Nov. 2007.
• [DLMM07] Tanja Davidovic, Leo Liberti, Nelson Maculan, Nenad Mladenovic, Towards the Optimal Solution of the Multiprocessor Scheduling Problem with Communication Delays, MISTA 2007 International Conference Proceedings Paris, August 2007.
• [L07A] Leo Liberti, Compact linearization of binary quadratic problems, 4OR, 5(3):231-245, 2007.
• [KBLM07] Sergei Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan, The Kissing Number Problem: New Results from Global Optimization (PDF), Discrete Applied Mathematics, 155(14):1837-1841, 2007.
• [NBKL07] Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti, Fast point-to-point shortest path queries on dynamic road networks with interval data, CTW 2007 Proceedings, Enschede, May 2007.
• [PLA07] Marie-Christine Plateau, Leo Liberti, Laurent Alfandari Edge cover by bipartite subgraphs, CTW 2007 Proceedings, Enschede, May 2007.
• [L07] Leo Liberti A useful characterization of the feasible region of binary linear programs, CTW 2007 Proceedings, Enschede, May 2007.
• [LLMN07] Leo Liberti, Carlile Lavor, Nelson Maculan, Marco-Antonio Chaer Nascimento, Solving Hartree-Fock systems with global optimization methods, Europhysics Letters, 77:50006, 2007.

2006

• [BL06] Maurizio Bruglieri, Leo Liberti, Modelling the optimal design of a biomass-based energy production process, ORMMES Proceedings, Coimbra, Oct. 2006
• [DO06] Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl (eds.) Graphs and Combinatorial Optimization, Discrete Optimization: Special issue dedicated to the CTW04 Conference, September 2006.
• [LP06] Leo Liberti, Costas Pantelides, An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms, Journal of Global Optimization, 36:161-189, 2006.
• [LLMA06] Leo Liberti, Carlile Lavor, Nelson Maculan, Computational experience with the molecular distance geometry problem (PDF), in J. Pintér (ed.), Global Optimization: Scientific and Engineering Case Studies, Springer, Berlin, 2006.
• [L06] Leo Liberti, Writing Global Optimization Software (PDF), in Liberti, Maculan (eds.), Global Optimization: from Theory to Implementation, Springer, Berlin, 2006, 211-262.
• [LM06] Leo Liberti, Nelson Maculan (eds.), Global Optimization: from Theory to Implementation (PDF), Springer, Berlin, 2006. The original publication is available on the Springer site.

2005

• [LLM2005B] Leo Liberti, Carlile Lavor, Nelson Maculan, Double VNS for the Molecular Distance Geometry Problem (PDF), Proc. of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, November 2005.
• [LLM2005A] Leo Liberti, Carlile Lavor, Nelson Maculan, Grover's Algorithm applied to the Molecular Distance Geometry Problem (PDF), Proc. of VII Brazilian Congress of Neural Networks, Natal, 16-19 October 2005.
• [LD2005] Leo Liberti, Milan Drazic, Variable Neighbourhood Search for the Global Optimization of Constrained NLPs, Proc. of the Global Optimization Workshop, Almeria, Spain, 18-22 September 2005.
• [L2005] Leo Liberti, Linearity embedded in nonconvex programs (PDF), Journal of Global Optimization, 33(2):157-196, 2005.
• [LAMM2005] Leo Liberti, Edoardo Amaldi, Nelson Maculan, Francesco Maffioli, Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases (PDF), Yugoslav Journal of Operational Research, 15(1):15-24, 2005.
• [LK2005] Leo Liberti, Sergei Kucherenko, Comparison of Deterministic and Stochastic Approaches to Global Optimization (PDF), International Transactions in Operational Research, 12(3):263-286, 2005.

2004

• [LMK2004] Leo Liberti, Nelson Maculan, Sergei Kucherenko, The Kissing Number Problem: a New Result from Global Optimization (PDF), CTW04 Workshop Proceedings, Menaggio, Italy, June 2004.
• [ALMM2004B] Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli, Algorithms for finding minimum fundamental cycle bases in graphs (PDF), CTW04 Workshop Proceedings, Menaggio, Italy, June 2004.
• [LM2004] Leo Liberti, Francesco Maffioli, CTW04 Workshop Proceedings (PDF), Menaggio, Italy, June 2004.
• [ALMM2004A] Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli, Efficient edge-swapping heuristics for finding minimum fundamental cycle bases (PDF), in C. Ribeiro and S. Martins (eds.), Experimental and Efficient Algorithms, LNCS 3059:14-29, Springer 2004
• [L2004D] Leo Liberti, On a class of nonconvex problems where all local minima are global (PDF), Publications de l'Institute Mathématique, 76(90):101-109, 2004.
• [DLMM2004] Tatjana Davidovic, Leo Liberti, Nelson Maculan, Nenad Mladenovic, Mathematical programming-based approach to scheduling of communicating tasks, Les Cahiers du GERAD (ISSN:0711-2440) G-2004-99, 2004.
• [L2004C] Leo Liberti, Automatic Reformulation of Bilinear MINLPs (PDF), DEI - Politecnico di Milano, Internal Report 2004.24.
• [L2004B] Leo Liberti, Reformulation and Convex Relaxation Techniques for Global Optimization (PDF), Ph.D. Thesis, Imperial College London, UK, March 2004 (extended abstract (PDF) published on 4OR, 2:255-258, 2004).
• [L2004A] Leo Liberti, Reduction Constraints for the Global Optimization of NLPs (PDF), International Transactions in Operational Research, 11(1): 33-41, 2004.

2003

• [ALMM2003B] Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli, Local Search for the Minimum Fundamental Cycle Basis Problem (PDF), Workshop on Real-life Applications of Metaheuristics, Antwerp, 18 Dec. 2003.
• [ALMM2003A] Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli, The Minimum Fundamental Cycle Basis Problem: a New Heuristic based on Edge Swaps (PDF), SYM-OP-IS 2003 Conference Proceedings, Herceg-Novi, Crna Gora, 30 Sept. 2003.
• [L2003B] Leo Liberti, Effective RLT Tightening in Continuous Bilinear Programs (PDF), Politecnico di Milano, Internal Report 2003.18.
• [LP2003] Leo Liberti, Costantinos C. Pantelides, Convex Envelopes of Monomials of Odd Degree (PDF), Journal of Global Optimization, 25, 157-168, 2003.
• [L2003A] Leo Liberti, Comparison of Convex Relaxations for Monomials of Odd Degree (PDF), in I. Tsevendorj, P.M. Pardalos, R. Enkhbat (eds.), Optimization and Optimal Control, World Scientific Publishing Co., 2003.

Days of Yore

• [L1999] Leo Liberti, Structure of the Invertible CA Transformations Group (PDF), Journal of Computer and System Sciences, 59, 521-536, 1999.
• [L1995] Leo Liberti, Ottaviano Fabrizio Mossotti: the Youth Years (1791-1823), B.Sc. Thesis, Maths Dept., Imperial College, June 1995.

System administration

• Leo Liberti, Franco Raimondi, An Economical Scheme for Quasi Real-Time Backup, SysAdmin Magazine, 11(7), July 2002.
• Leo Liberti Web-enabled Filesystem-based Databases, SysAdmin Magazine, 11(3), March 2002.
• Leo Liberti, Franco Raimondi, La mia prima pagina dinamica, Inter.net Magazine, 70 July/August 2001 (in Italian).
• Leo Liberti, Automating Firewall Log Scanning, Linux Journal, 87:104-107, July 2001.
• Leo Liberti, Quick Network Redundancy Schemes, SysAdmin Magazine, 10(4):8-16, 2001.