Leo Liberti

Publications

Mathematics

Current (accepted) work

• [LL] Jon Lee and Leo Liberti, A matroid view of key theorems for edge-swapping algorithms, Mathematical Methods of Operations Research, accepted.
• [MLL] Antonio Mucherino, Carlile Lavor, Leo Liberti, Exploiting symmetry properties of the Discretizable Molecular Distance Geometry Problem, Journal of Bioinformatics and Computational Biology, accepted.
• [CHL] Sonia Cafieri, Pierre Hansen, Leo Liberti, Improving heuristics for network modularity maximization using an exact algorithm, Discrete Applied Mathematics, accepted.
• [GKLR] Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda, Technological architecture evolutions of information systems: trade-off and optimization, Concurrent Engineering Research and Applications, accepted.
• [LL] Leo Liberti, Carlile Lavor, On a relationship between graph realizability and distance matrix completion, in A.~Migdalas (ed.), Optimization Theory, Decision Making, and Operational Research Applications, Springer, Berlin, accepted.
• [CHLLFM] Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine, Compact relaxations for polynomial programming problems, in Experimental Algorithms, LNCS, accepted.
• [CL] Alberto Costa, Leo Liberti, Relaxations of multilinear convex envelopes: dual is better than primal, in Experimental Algorithms, LNCS, accepted.
• [KLW] Dominik Kirchler, Leo Liberti, Robert Wolfler Calvo, A label correcting algorithm for the shortest path problem on a multi-modal route network, in Experimental Algorithms, LNCS, accepted.
• [FL] Matteo Fischetti, Leo Liberti Orbital shrinking, in Proceedings of the International Symposium of Combinatorial Optimization, LNCS, accepted.
• [ACHLPR] Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, Manuel Ruiz, Modularity maximization in networks by Variable Neighbourhood Search, in Proceedings of 10th DIMACS Implementation Challenge Workshop, accepted.
• [HDKLW] 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, in M. Marcellin et al. (eds.), Proceedings of the Data Compression Conference, accepted.
• [BCLLM] 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.), Proceedings of ICOSC11, Springer, Berlin, accepted.
• [LLMb] Carlile Lavor, Leo Liberti, Antonio Mucherino, The intervalBranch-and-Prune algorithm for the discretizable molecular distance geometry problem with interval data, Journal of Global Optimization, accepted.
• [SMSGLL] 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, accepted.
• [MLL] Antonio Mucherino, Carlile Lavor, Leo Liberti, The discretizable distance geometry problem, Optimization Letters, accepted.
• [SDL] Hanif Sherali, Evrim Dalkiran, Leo Liberti, Reduced RLT representations for nonconvex polynomial programming problems, Journal of Global Optimization, to appear.
• [DFLL] Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi, A storm of Feasibility Pumps for nonconvex MINLP, Mathematical Programming B, accepted.
• [LLMM] Carlile Lavor, Leo Liberti, Nelson Maculan, Antonio Mucherino, The discretizable molecular distance geometry problem, Computational Optimization and Applications, to appear.

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.
• [LLMMb12] 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.
• [Lb12] 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.
• [CHLb11] 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.
• [LMLM11] 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.
• [LMLM11] 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

• [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.
• [LMLMb10] 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.

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.