Fondamenti algebrici degli automi cellulari invertibili. (Algebraic foundations of invertible cellular automata / Fondations algébriques des automates cellulaires inversibles). - Leo Liberti (1997)

Structure of the Invertible CA Transformations Group. - Leo Liberti (J. Comput. Syst. Sci., 1999)

Performance Comparison of Function Evaluation Methods - Leo Liberti (CoRR, 2002)

Convex Envelopes of Monomials of Odd Degree. - Leo Liberti; Constantinos C. Pantelides (J. Glob. Optim., 2003)

Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. - Edoardo Amaldi; Leo Liberti; Francesco Maffioli (CTW, 2004)

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. - Edoardo Amaldi; Leo Liberti; Nelson Maculan; Francesco Maffioli (WEA, 2004)

Reformulation and convex relaxation techniques for global optimization. - Leo Liberti (4OR, 2004)

Algorithms for finding minimum fundamental cycle bases in graphs. - Edoardo Amaldi; Leo Liberti; Francesco Maffioli; Nelson Maculan (Electron. Notes Discret. Math., 2004)

Preface. - Leo Liberti; Francesco Maffioli (Electron. Notes Discret. Math., 2004)

The Kissing Number Problem: A New Result from Global Optimization. - Leo Liberti; Nelson Maculan; Sergei S. Kucherenko (Electron. Notes Discret. Math., 2004)

Reformulation and Convex Relaxation Techniques for Global Optimization. (Techniques de reformulation et relaxation convexe pour l'optimisation globale). - Leo Liberti (2004)

Comparison of deterministic and stochastic approaches to global optimization. - Leo Liberti; Sergei S. Kucherenko (Int. Trans. Oper. Res., 2005)

Linearity Embedded in Nonconvex Programs. - Leo Liberti (J. Glob. Optim., 2005)

Graphs and combinatorial optimization. - Ulrich Faigle; Leo Liberti; Francesco Maffioli; Stefan Pickl (Discret. Optim., 2006)

An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms. - Leo Liberti; Constantinos C. Pantelides (J. Glob. Optim., 2006)

Reformulation techniques in Mathematical Programming. - Leo Liberti (2007)

A useful characterization of the feasible region of binary linear programs. - Leo Liberti (CTW, 2007)

Fast point-to-point shortest path queries on dynamic road networks with interfal data. - Giacomo Nannicini; Philippe Baptiste; Daniel Krob; Leo Liberti (CTW, 2007)

Edge cover by bipartite subgraphs. - Marie-Christine Plateau; Leo Liberti; Laurent Alfandari (CTW, 2007)

Compact linearization for binary quadratic problems. - Leo Liberti (4OR, 2007)

New formulations for the Kissing Number Problem. - Sergei S. Kucherenko; Pietro Belotti; Leo Liberti; Nelson Maculan (Discret. Appl. Math., 2007)

The Secret Santa Problem. - Leo Liberti; Franco Raimondi (AAIM, 2008)

Automatic Generation of Symmetry-Breaking Constraints. - Leo Liberti (COCOA, 2008)

Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. - Giacomo Nannicini; Philippe Baptiste; Daniel Krob; Leo Liberti (COCOA, 2008)

Reformulations in Mathematical Programming: Definitions. - Leo Liberti (CTW, 2008)

Bidirectional A* on Time-dependent Graphs. - Giacomo Nannicini; Daniel Delling; Leo Liberti; Dominik Schultes (CTW, 2008)

Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem. - Kanika Dhyani; Leo Liberti (MCO, 2008)

Bidirectional A* Search for Time-Dependent Fast Paths. - Giacomo Nannicini; Daniel Delling; Leo Liberti; Dominik Schultes (WEA, 2008)

Spherical cuts for integer programming problems. - Leo Liberti (Int. Trans. Oper. Res., 2008)

A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem. - Leo Liberti; Carlile Lavor; Nelson Maculan (Int. Trans. Oper. Res., 2008)

Shortest paths on dynamic graphs. - Giacomo Nannicini; Leo Liberti (Int. Trans. Oper. Res., 2008)

Combinatorial Optimization Based Recommender Systems. - Fabio Roda; Leo Liberti; Franco Raimondi (CTW, 2009)

Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. - Antonio Mucherino; Leo Liberti; Carlile Lavor; Nelson Maculan (GECCO, 2009)

Computing artificial backbones of hydrogen atoms in order to discover protein backbones. - Carlile Lavor; Antonio Mucherino; Leo Liberti; Nelson Maculan (IMCSIT, 2009)

On a discretizable subclass of instances of the molecular distance geometry problem. - Carlile Lavor; Leo Liberti; Antonio Mucherino; Nelson Maculan (SAC, 2009)

Reformulation in mathematical programming: An application to quantum chemistry. - Leo Liberti; Carlile Lavor; Nelson Maculan; Marco Antonio Chaer Nascimento (Discret. Appl. Math., 2009)

Reformulation techniques in mathematical programming. - Leo Liberti; Nelson Maculan (Discret. Appl. Math., 2009)

Double variable neighbourhood search with smoothing for the molecular distance geometry problem. - Leo Liberti; Carlile Lavor; Nelson Maculan; Fabrizio Marinelli 001 (J. Glob. Optim., 2009)

Edge-swapping algorithms for the minimum fundamental cycle basis problem. - Edoardo Amaldi; Leo Liberti; Francesco Maffioli; Nelson Maculan (Math. Methods Oper. Res., 2009)

Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem. - Leo Liberti; Nelson Maculan; Yue Zhang (Optim. Lett., 2009)

Branching and bounds tighteningtechniques for non-convex MINLP. - Pietro Belotti; Jon Lee 001; Leo Liberti; François Margot; Andreas Wächter (Optim. Methods Softw., 2009)

Reformulations in Mathematical Programming: Definitions and Systematics. - Leo Liberti (RAIRO Oper. Res., 2009)

Molecular Distance Geometry Problem. - Carlile Lavor; Leo Liberti; Nelson Maculan (Encyclopedia of Optimization, 2009)

Reformulation-Linearization Technique for Global Optimization. - Hanif D. Sherali; Leo Liberti (Encyclopedia of Optimization, 2009)

Reformulations in Mathematical Programming: A Computational Approach. - Leo Liberti; Sonia Cafieri; Fabien Tarissan (Foundations of Computational Intelligence (3), 2009)

A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem. - Antonio Mucherino; Carlile Lavor; Leo Liberti; El-Ghazali Talbi (AICCSA, 2010)

On the solution of molecular distance geometry problems with interval data. - Carlile Lavor; Leo Liberti; Antonio Mucherino (BIBM Workshops, 2010)

Feasibility-Based Bounds Tightening via Fixed Points. - Pietro Belotti; Sonia Cafieri; Jon Lee 001; Leo Liberti (COCOA (1), 2010)

On the Convergence of Feasibility based Bounds Tightening. - Pietro Belotti; Sonia Cafieri; Jon Lee 001; Leo Liberti (CTW, 2010)

Static Symmetry Breaking in Circle Packing. - Alberto Costa; Pierre Hansen; Leo Liberti (CTW, 2010)

Optimal Technological Architecture Evolutions of Information Systems. - Vassilis Giakoumakis; Daniel Krob; Leo Liberti; Fabio Roda (CSDM, 2010)

The Reformulation-Optimization Software Engine. - Leo Liberti; Sonia Cafieri; David Savourey (ICMS, 2010)

MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems. - Antonio Mucherino; Leo Liberti; Carlile Lavor (ICMS, 2010)

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. - Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti; Andrea Lodi 001 (SEA, 2010)

Fast paths in large-scale dynamic road networks. - Giacomo Nannicini; Philippe Baptiste; Gilles Barbier; Daniel Krob; Leo Liberti (Comput. Optim. Appl., 2010)

Formulation symmetries in circle packing. - Alberto Costa; Leo Liberti; Pierre Hansen (Electron. Notes Discret. Math., 2010)

Mathematical programming based debugging. - Leo Liberti; Stéphane Le Roux 001; Jeremy Leconte; Fabrizio Marinelli 001 (Electron. Notes Discret. Math., 2010)

Static Analysis by Abstract Interpretation: A Mathematical Programming Approach. - Eric Goubault; Stéphane Le Roux 001; Jeremy Leconte; Leo Liberti; Fabrizio Marinelli 001 (NSAD@SAS, 2010)

On convex relaxations of quadrilinear terms. - Sonia Cafieri; Jon Lee 001; Leo Liberti (J. Glob. Optim., 2010)

On interval-subgradient and no-good cuts. - Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti; Andrea Lodi 001 (Oper. Res. Lett., 2010)

A Good Recipe for Solving MINLPs. - Leo Liberti; Giacomo Nannicini; Nenad Mladenovic (Matheuristics, 2010)

UniALT for regular language contrained shortest paths on a multi-modal transportation network. - Dominik Kirchler; Leo Liberti; Thomas Pajor; Roberto Wolfler Calvo (ATMOS, 2011)

A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry Problem. - Antonio Mucherino; Carlile Lavor; Leo Liberti (BIBM Workshops, 2011)

On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem. - Leo Liberti; Benoît Masson; Jon Lee 001; Carlile Lavor; Antonio Mucherino (COCOA, 2011)

Bound constraints for Point Packing in a Square. - Alberto Costa; Pierre Hansen; Leo Liberti (CTW, 2011)

Branch-and-Prune trees with bounded width. - Leo Liberti; Benoît Masson; Carlile Lavor; Antonio Mucherino (CTW, 2011)

The price of equity in the Hazmat. - Fabio Roda; Pierre Hansen; Leo Liberti (CTW, 2011)

A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem. - Nora Touati Moungla; Pietro Belotti; Vincent Jost; Leo Liberti (INOC, 2011)

Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems. - Antonio Mucherino; Carlile Lavor; Therese E. Malliavin; Leo Liberti; Michael Nilges; Nelson Maculan (SEA, 2011)

Evaluation of Collaborative Filtering Algorithms Using a Small Dataset. - Fabio Roda; Leo Liberti; Franco Raimondi (WEBIST, 2011)

Optimal recommender systems blending. - Fabio Roda; Alberto Costa; Leo Liberti (WIMS, 2011)

Edge cover by connected bipartite subgraphs. - Leo Liberti; Laurent Alfandari; Marie-Christine Plateau (Ann. Oper. Res., 2011)

Polynomial cases of the Discretizable Molecular Distance Geometry Problem - Leo Liberti; Carlile Lavor; Benoît Masson; Antonio Mucherino (CoRR, 2011)

8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009). - Sonia Cafieri; Ulrich Faigle; Leo Liberti (Discret. Appl. Math., 2011)

A note on "A branch-and-prune algorithm for the molecular distance geometry problem". - Carlile Lavor; Leo Liberti; Nelson Maculan (Int. Trans. Oper. Res., 2011)

Molecular distance geometry methods: from continuous to discrete. - Leo Liberti; Carlile Lavor; Antonio Mucherino; Nelson Maculan (Int. Trans. Oper. Res., 2011)

On the computation of protein backbones by using artificial backbones of hydrogens. - Carlile Lavor; Antonio Mucherino; Leo Liberti; Nelson Maculan (J. Glob. Optim., 2011)

Improved strategies for branching on general disjunctions. - Gérard Cornuéjols; Leo Liberti; Giacomo Nannicini (Math. Program., 2011)

A recipe for finding good solutions to MINLPs. - Leo Liberti; Nenad Mladenovic; Giacomo Nannicini (Math. Program. Comput., 2011)

Branching on Split Disjunctions. - Giacomo Nannicini; Gérard Cornuéjols; Miroslav Karamanov; Leo Liberti (Combinatorial Optimization - Methods and Applications, 2011)

Invex Formulations of Unbounded Disjunctions. - Hassan L. Hijazi; Leo Liberti (CTW, 2012)

Modelling Rank Constraints in Mathematical Programming. - Leo Liberti (CTW, 2012)

A MILP Approach for Designing Robust Variable-Length Codes Based on Exact Free Distance Computation. - Hassan L. Hijazi; Amadou Diallo; Michel Kieffer; Leo Liberti; Claudio Weidmann (DCC, 2012)

Modularity maximization in networks by variable neighborhood search. - Daniel Aloise; Gilles Caporossi; Pierre Hansen; Leo Liberti; Sylvain Perron; Manuel Ruiz (Graph Partitioning and Graph Clustering, 2012)

Orbital Shrinking. - Matteo Fischetti; Leo Liberti (ISCO, 2012)

Compact Relaxations for Polynomial Programming Problems. - Sonia Cafieri; Pierre Hansen; Lucas Létocart; Leo Liberti; Frédéric Messine (SEA, 2012)

Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal. - Alberto Costa; Leo Liberti (SEA, 2012)

A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network. - Dominik Kirchler; Leo Liberti; Roberto Wolfler Calvo (SEA, 2012)

No end of the world in 2012 for 4OR. - Leo Liberti; Thierry Marchant; Silvano Martello (4OR, 2012)

Technological architecture evolutions of information systems: Trade-off and optimization. - Vassilis Giakoumakis; Daniel Krob; Leo Liberti; Fabio Roda (Concurr. Eng. Res. Appl., 2012)

The discretizable molecular distance geometry problem. - Carlile Lavor; Leo Liberti; Nelson Maculan; Antonio Mucherino (Comput. Optim. Appl., 2012)

Recent advances on the Discretizable Molecular Distance Geometry Problem. - Carlile Lavor; Leo Liberti; Nelson Maculan; Antonio Mucherino (Eur. J. Oper. Res., 2012)

Exploiting Symmetry Properties of the Discretizable molecular Distance Geometry Problem. - Antonio Mucherino; Carlile Lavor; Leo Liberti (J. Bioinform. Comput. Biol., 2012)

Reduced RLT representations for nonconvex polynomial programming problems. - Hanif D. Sherali; Evrim Dalkiran; Leo Liberti (J. Glob. Optim., 2012)

A matroid view of key theorems for edge-swapping algorithms. - Jon Lee 001; Leo Liberti (Math. Methods Oper. Res., 2012)

An improved column generation algorithm for minimum sum-of-squares clustering. - Daniel Aloise; Pierre Hansen; Leo Liberti (Math. Program., 2012)

Preface. - Pierre Bonami; Leo Liberti; Andrew J. Miller; Annick Sartenaer (Math. Program., 2012)

A storm of feasibility pumps for nonconvex MINLP. - Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti; Andrea Lodi 001 (Math. Program., 2012)

Reformulations in mathematical programming: automatic symmetry detection and exploitation. - Leo Liberti (Math. Program., 2012)

Bidirectional A* search on time-dependent road networks. - Giacomo Nannicini; Daniel Delling; Dominik Schultes; Leo Liberti (Networks, 2012)

Discretization orders for distance geometry problems. - Carlile Lavor; Jon Lee 001; Audrey Lee-St. John; Leo Liberti; Antonio Mucherino; Maxim Sviridenko (Optim. Lett., 2012)

The discretizable distance geometry problem. - Antonio Mucherino; Carlile Lavor; Leo Liberti (Optim. Lett., 2012)

Is the Distance Geometry Problem in NP? - Nathanael Beeker; Stéphane Gaubert; Christian Glusa; Leo Liberti (Distance Geometry, 2013)

The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins. - Leo Liberti; Carlile Lavor; Antonio Mucherino (Distance Geometry, 2013)

Counting the Number of Solutions of KDMDGP Instances. - Leo Liberti; Carlile Lavor; Jorge Alencar; Germano Abud (GSI, 2013)

The integration of Clifford Algebra in the iBP algorithm for the DMDGP. - Rafael Alves; Andrea Cassioli; Antonio Mucherino; Carlile Lavor; Leo Liberti (IWBBIO, 2013)

Preface. - Leo Liberti; Thierry Marchant; Silvano Martello (Ann. Oper. Res., 2013)

Eleven surveys in operations research: III. - Leo Liberti; Thierry Marchant; Silvano Martello (Ann. Oper. Res., 2013)

A two-phase heuristic for the bottleneck k-hyperplane clustering problem. - Edoardo Amaldi; Kanika Dhyani; Leo Liberti (Comput. Optim. Appl., 2013)

The Anonymous Subgraph Problem. - Andrea Bettinelli; Leo Liberti; Franco Raimondi; David Savourey (Comput. Oper. Res., 2013)

On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. - Alberto Costa; Pierre Hansen; Leo Liberti (Discret. Appl. Math., 2013)

A discrete search algorithm for finding the structure of protein backbones and side chains. - Silas Sallaume; Simone de Lima Martins; Luiz Satoru Ochi; Warley Gramacho Da Silva; Carlile Lavor; Leo Liberti (Int. J. Bioinform. Res. Appl., 2013)

Toulouse Global optimization Workshop 2010 (TOGO10). - Sonia Cafieri; Leo Liberti; Frédéric Messine (J. Glob. Optim., 2013)

The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances. - Carlile Lavor; Leo Liberti; Antonio Mucherino (J. Glob. Optim., 2013)

A VNS-Based Heuristic for Feature Selection in Data Mining. - Antonio Mucherino; Leo Liberti (Hybrid Metaheuristics, 2013)

Improving heuristics for network modularity maximization using an exact algorithm. - Sonia Cafieri; Pierre Hansen; Leo Liberti (Discret. Appl. Math., 2014)

On the number of realizations of certain Henneberg graphs arising in protein conformation. - Leo Liberti; Benoît Masson; Jon Lee 001; Carlile Lavor; Antonio Mucherino (Discret. Appl. Math., 2014)

Mathematical programming: Turing completeness and applications to software analysis. - Leo Liberti; Fabrizio Marinelli 001 (J. Comb. Optim., 2014)

Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks. - Dominik Kirchler; Leo Liberti; Roberto Wolfler Calvo (ACM J. Exp. Algorithmics, 2014)

Stabilizer-based symmetry breaking constraints for mathematical programs. - Leo Liberti; James Ostrowski (J. Glob. Optim., 2014)

On the Weber facility location problem with limited distances and side constraints. - Isaac F. Fernandes; Daniel Aloise; Dario J. Aloise; Pierre Hansen; Leo Liberti (Optim. Lett., 2014)

Euclidean Distance Geometry and Applications. - Leo Liberti; Carlile Lavor; Nelson Maculan; Antonio Mucherino (SIAM Rev., 2014)

Orbital Independence in Symmetric Mathematical Programs. - Gustavo Dias; Leo Liberti (COCOA, 2015)

Observing the State of a Smart Grid Using Bilevel Programming. - Sonia Toubaline; Pierre-Louis Poirion; Claudia D'Ambrosio; Leo Liberti (COCOA, 2015)

Modelling Rank Constraints in Mathematical Programming. - Gustavo Dias; Leo Liberti; Nelson Maculan (CTW, 2015)

Distance Geometry on the Sphere. - Leo Liberti; Grzegorz Swirszcz; Carlile Lavor (JCDCGG, 2015)

Simulation and optimization of energy efficient operation of HVAC system as demand response with distributed energy resources. - Young M. Lee; Raya Horesh; Leo Liberti (WSC, 2015)

The dirty dozen of 4OR. - Leo Liberti; Thierry Marchant; Silvano Martello (4OR, 2015)

An algorithm to enumerate all possible protein conformations verifying a set of distance constraints. - Andrea Cassioli; Benjamin Bardiaux; Guillaume Bouvier; Antonio Mucherino; Rafael Alves; Leo Liberti; Michael Nilges; Carlile Lavor; Thérèse E. Malliavin (BMC Bioinform., 2015)

Optimization and sustainable development. - Leo Liberti (Comput. Manag. Sci., 2015)

Using the Johnson-Lindenstrauss lemma in linear and integer programming. - Ky Khac Vu; Pierre-Louis Poirion; Leo Liberti (CoRR, 2015)

Discretization vertex orders in distance geometry. - Andrea Cassioli; Oktay Günlük; Carlile Lavor; Leo Liberti (Discret. Appl. Math., 2015)

An algorithm for realizing Euclidean distance matrices. - Jorge Alencar; Tibérius O. Bonates; Carlile Lavor; Leo Liberti (Electron. Notes Discret. Math., 2015)

Community detection with the weighted parsimony criterion. - Andrea Bettinelli; Pierre Hansen; Leo Liberti (J. Syst. Sci. Complex., 2015)

Diagonally Dominant Programming in Distance Geometry. - Gustavo Dias; Leo Liberti (ISCO, 2016)

The Learnability of Business Rules. - Olivier Wang; Changhai Ke; Leo Liberti; Christian de Sainte Marie (MOD, 2016)

Controlling the Average Behavior of Business Rules Programs. - Olivier Wang; Leo Liberti; Claudia D'Ambrosio; Christian de Sainte Marie; Changhai Ke (RuleML, 2016)

Twelve surveys in operations research. - Leo Liberti; Thierry Marchant; Silvano Martello (Ann. Oper. Res., 2016)

Divisive heuristic for modularity density maximization. - Alberto Costa; Sergey Kushnarev; Leo Liberti; Zeyu Sun (Comput. Oper. Res., 2016)

Open research areas in distance geometry. - Leo Liberti; Carlile Lavor (CoRR, 2016)

New methods for the Distance Geometry Problem. - Gustavo Dias; Leo Liberti (Electron. Notes Discret. Math., 2016)

Solving LP using random projections. - Leo Liberti; Pierre-Louis Poirion; Ky Khac Vu (Electron. Notes Discret. Math., 2016)

Preface to the Special Issue on Many Faces of Distances. - Carlile Lavor; Marcelo Firer; José Mario Martínez; Leo Liberti (Int. Trans. Oper. Res., 2016)

Six mathematical gems from the history of distance geometry. - Leo Liberti; Carlile Lavor (Int. Trans. Oper. Res., 2016)

The power edge set problem. - Pierre-Louis Poirion; Sonia Toubaline; Claudia D'Ambrosio; Leo Liberti (Networks, 2016)

Constraint qualification failure in action. - Hassan L. Hijazi; Leo Liberti (Oper. Res. Lett., 2016)

Euclidean Distance Geometry - an Introduction. - Leo Liberti; Carlile Lavor (Springer, 2017)

Distance Geometry in Linearizable Norms. - Claudia D'Ambrosio; Leo Liberti (GSI, 2017)

Controlling Some Statistical Properties of Business Rules Programs. - Olivier Wang; Leo Liberti (LION, 2017)

The Isomap Algorithm in Distance Geometry. - Leo Liberti; Claudia D'Ambrosio (SEA, 2017)

Orbital shrinking: Theory and applications. - Matteo Fischetti; Leo Liberti; Domenico Salvagnin; Toby Walsh (Discret. Appl. Math., 2017)

New Error Measures and Methods for Realizing Protein Graphs from Distance Data. - Claudia D'Ambrosio; Ky Khac Vu; Carlile Lavor; Leo Liberti; Nelson Maculan (Discret. Comput. Geom., 2017)

A multiplicative weights update algorithm for MINLP. - Luca Mencarelli; Youcef Sahraoui; Leo Liberti (EURO J. Comput. Optim., 2017)

Surrogate-based methods for black-box optimization. - Ky Khac Vu; Claudia D'Ambrosio; Youssef Hamadi; Leo Liberti (Int. Trans. Oper. Res., 2017)

Recent advances on the interval distance geometry problem. - Douglas Soares Gonçalves; Antonio Mucherino; Carlile Lavor; Leo Liberti (J. Glob. Optim., 2017)

An Introduction to Distance Geometry applied to Molecular Geometry - Carlile Lavor; Leo Liberti; Weldon A. Lodwick; Tiago Mendonça da Costa (Springer, 2017)

Maximum Concurrent Flow with Incomplete Data. - Pierre-Olivier Bauguion; Claudia D'Ambrosio; Leo Liberti (ISCO, 2018)

Alternating Current Optimal Power Flow with Generator Selection. - Esteban Salgado; Andrea Scozzari; Fabio Tardella; Leo Liberti (ISCO, 2018)

Universality and prediction in business rules. - Olivier Wang; Christian de Sainte Marie; Changhai Ke; Leo Liberti (Comput. Intell., 2018)

Shortest Path Problem variants for the Hydro Unit Commitment Problem. - Wim van Ackooij; Claudia D'Ambrosio; Leo Liberti; Raouia Taktak; Dimitri Thomopulos; Sonia Toubaline (Electron. Notes Discret. Math., 2018)

Complexity and inapproximability results for the Power Edge Set problem. - Sonia Toubaline; Claudia D'Ambrosio; Leo Liberti; Pierre-Louis Poirion; Baruch Schieber; Hadas Shachnai (J. Comb. Optim., 2018)

Preface: Special issue dedicated to Distance Geometry. - Farid Alizadeh; Douglas Soares Gonçalves; Nathan Krislock; Leo Liberti (J. Glob. Optim., 2018)

A symmetry-based splitting strategy for discretizable distance geometry problems. - Felipe Fidalgo; Douglas Soares Gonçalves; Carlile Lavor; Leo Liberti; Antonio Mucherino (J. Glob. Optim., 2018)

Tuning interval Branch-and-Prune for protein structure determination. - Bradley Worley; Florent Delhommel; Florence Cordier; Thérèse E. Malliavin; Benjamin Bardiaux; Nicolas Wolff; Michael Nilges; Carlile Lavor; Leo Liberti (J. Glob. Optim., 2018)

Random Projections for Linear Programming. - Ky Khac Vu; Pierre-Louis Poirion; Leo Liberti (Math. Oper. Res., 2018)

Barvinok's naive algorithm in Distance Geometry. - Leo Liberti; Ky Khac Vu (Oper. Res. Lett., 2018)

Random Projections for Quadratic Programs over a Euclidean Ball. - Ky Khac Vu; Pierre-Louis Poirion; Claudia D'Ambrosio; Leo Liberti (IPCO, 2019)

On the Observability of Smart Grids and Related Optimization Methods. - Claudia D'Ambrosio; Leo Liberti; Pierre-Louis Poirion; Sonia Toubaline (OR, 2019)

Geometry and Analogies: A Study and Propagation Method for Word Representations. - Sammy Khalife; Leo Liberti; Michalis Vazirgiannis (SLSP, 2019)

Distance Geometry and Data Science. - Leo Liberti (CoRR, 2019)

Realizing Euclidean distance matrices by sphere intersection. - Jorge Alencar; Carlile Lavor; Leo Liberti (Discret. Appl. Math., 2019)

Preface. - Farid Alizadeh; Douglas Soares Gonçalves; Nathan Krislock; Leo Liberti (Discret. Appl. Math., 2019)

Minimal NMR distance information for rigidity of protein graphs. - Carlile Lavor; Leo Liberti; Bruce Randall Donald; Bradley Worley; Benjamin Bardiaux; Thérèse E. Malliavin; Michael Nilges (Discret. Appl. Math., 2019)

On the polynomiality of finding KDMDGP re-orders. - Carlile Lavor; Michael Souza 001; Luiz Mariano Carvalho; Leo Liberti (Discret. Appl. Math., 2019)

Gaussian random projections for Euclidean membership problems. - Ky Khac Vu; Pierre-Louis Poirion; Leo Liberti (Discret. Appl. Math., 2019)

Systematic Exploration of Protein Conformational Space Using a Distance Geometry Approach. - Thérèse E. Malliavin; Antonio Mucherino; Carlile Lavor; Leo Liberti (J. Chem. Inf. Model., 2019)

QPLIB: a library of quadratic programming instances. - Fabio Furini; Emiliano Traversi; Pietro Belotti; Antonio Frangioni; Ambros M. Gleixner; Nick Gould; Leo Liberti; Andrea Lodi 001; Ruth Misener; Hans D. Mittelmann; Nikolaos V. Sahinidis; Stefan Vigerske; et al. (Math. Program. Comput., 2019)

A mathematical programming formulation for the Hartree-Fock problem on open-shell systems. - Leo Liberti; Carlile Lavor; Nelson Maculan (Optim. Lett., 2019)

Undecidability and hardness in mixed-integer nonlinear programming. - Leo Liberti (RAIRO Oper. Res., 2019)

MD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data. - Antonio Mucherino; Douglas Soares Gonçalves; Leo Liberti; Jung-Hsin Lin; Carlile Lavor; Nelson Maculan (FedCSIS, 2020)

Learning to Configure Mathematical Programming Solvers by Mathematical Programming. - Gabriele Iommazzo; Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti (LION, 2020)

A Learning-Based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers. - Gabriele Iommazzo; Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti (LOD (1), 2020)

A Question Answering System for Interacting with SDMX Databases. - Guillaume Thiry; Ioana Manolescu; Leo Liberti (ASLD@ISWC, 2020)

A New Distance Geometry Method for Constructing Word and Sentence Vectors. - Leo Liberti (WWW (Companion Volume), 2020)

Mathematical programming formulations for the alternating current optimal power flow problem. - Dan Bienstock; Mauro Escobar; Claudio Gentile; Leo Liberti (4OR, 2020)

A new algorithm for the KDMDGP subclass of Distance Geometry Problems. - Douglas Soares Gonçalves; Carlile Lavor; Leo Liberti; Michael Souza 001 (CoRR, 2020)

MIP and Set Covering approaches for Sparse Approximation. - Diego Delle Donne; Matthieu Kowalski; Leo Liberti (CoRR, 2020)

Algorithms and applications for a class of bilevel MILPs. - Pierre-Louis Poirion; Sonia Toubaline; Claudia D'Ambrosio; Leo Liberti (Discret. Appl. Math., 2020)

Random projections for quadratic programs. - Claudia D'Ambrosio; Leo Liberti; Pierre-Louis Poirion; Ky Khac Vu (Math. Program., 2020)

The K-discretization and K-incident graphs for discretizable Distance Geometry. - Germano Abud; Jorge Alencar; Carlile Lavor; Leo Liberti; Antonio Mucherino (Optim. Lett., 2020)

On an SDP relaxation for kissing number. - Jon Lee 001; Leo Liberti (Optim. Lett., 2020)

A study on the impact of the distance types involved in protein structure determination by NMR. - Simon B. Hengeveld; Therese E. Malliavin; J. H. Lin; Leo Liberti; Antonio Mucherino (BIBM, 2021)

Pseudo-dihedral Angles in Proteins Providing a New Description of the Ramachandran Map. - Wagner Rocha; Carlile Lavor; Leo Liberti; Thérèse E. Malliavin (GSI (2), 2021)

A New Algorithm for the KDMDGP Subclass of Distance Geometry Problems with Exact Distances. - Douglas Soares Gonçalves; Carlile Lavor; Leo Liberti; Michael Souza 001 (Algorithmica, 2021)

Exploiting symmetries in mathematical programming via orbital independence. - Gustavo Dias; Leo Liberti (Ann. Oper. Res., 2021)

Random projections for conic programs. - Leo Liberti; Pierre-Louis Poirion; Ky Khac Vu (CoRR, 2021)

An impossible utopia in distance geometry. - Germano Abud; Jorge Alencar; Carlile Lavor; Leo Liberti; Antonio Mucherino (CoRR, 2021)

Preface: CTW 2018. - Fabio Furini; Amélie Lambert; Lucas Létocart; Leo Liberti; Emiliano Traversi (Discret. Appl. Math., 2021)

Detecting and solving aircraft conflicts using bilevel programming. - Martina Cerulli; Claudia D'Ambrosio; Leo Liberti; Mercedes Pelegrín (J. Glob. Optim., 2021)

Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice. - Ruobing Shen; Bo Tang 017; Leo Liberti; Claudia D'Ambrosio; Stéphane Canu (J. Glob. Optim., 2021)

Further results on latent discourse models and word embeddings. - Sammy Khalife; Douglas Soares Gonçalves; Youssef Allouah; Leo Liberti (J. Mach. Learn. Res., 2021)

Preface. - Leo Liberti; Sebastian Sager; Angelika Wiegele (Math. Program., 2021)

Polynomial programming prevents aircraft (and other) conflicts. - Martina Cerulli; Leo Liberti (Oper. Res. Lett., 2021)

Empirical Comparison of Semantic Similarity Measures for Technical Question Answering. - Nabil Moncef Boukhatem; Davide Buscaldi; Leo Liberti (ADBIS (Short Papers), 2022)

Practical Performance of Random Projections in Linear Programming. - Leo Liberti; Benedetto Manca; Pierre-Louis Poirion (SEA, 2022)

Maximum feasible subsystems of distance geometry constraints. - Maurizio Bruglieri; Roberto Cordone; Leo Liberti (J. Glob. Optim., 2022)

Unassigned distance geometry and molecular conformation problems. - Phillip M. Duxbury; Carlile Lavor; Leo Liberti; Luiz Leduíno de Salles Neto (J. Glob. Optim., 2022)

Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections. - Leo Liberti; Benedetto Manca (J. Glob. Optim., 2022)

Convergent Algorithms for a Class of Convex Semi-infinite Programs. - Martina Cerulli; Antoine Oustry; Claudia D'Ambrosio; Leo Liberti (SIAM J. Optim., 2022)

A Novel Integer Linear Programming Approach for Global L0 Minimization. - Diego Delle Donne; Matthieu Kowalski; Leo Liberti (J. Mach. Learn. Res., 2023)

Optimal deployment of indoor wireless local area networks. - Antoine Oustry; Marion Le Tilly; Thomas Heide Clausen; Claudia D'Ambrosio; Leo Liberti (Networks, 2023)

Cycle-based formulations in Distance Geometry. - Leo Liberti; Gabriele Iommazzo; Carlile Lavor; Nelson Maculan (Open J. Math. Optim., 2023)

Random Projections for Linear Programming: An Improved Retrieval Phase. - Leo Liberti; Benedetto Manca; Pierre-Louis Poirion (ACM J. Exp. Algorithmics, 2023)

Impact of Local Geometry on Methods for Constructing Protein Conformations. - Wagner Rocha; Therese E. Malliavin; Antonio Mucherino; Leo Liberti (FedCSIS, 2024)

The Algorithm Configuration Problem. - Gabriele Iommazzo; Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti (CoRR, 2024)

An impossible combinatorial counting method in distance geometry. - Germano Abud; Jorge Alencar; Carlile Lavor; Leo Liberti; Antonio Mucherino (Discret. Appl. Math., 2024)

Influence of Stereochemistry in a Local Approach for Calculating Protein Conformations. - Wagner Rocha; Leo Liberti; Antonio Mucherino; Thérèse E. Malliavin (J. Chem. Inf. Model., 2024)

Cutting Planes for Signomial Programming. - Liding Xu; Claudia D'Ambrosio; Leo Liberti; Sonia Haddad-Vanier (SIAM J. Optim., 2025)

Submodular maximization and its generalization through an intersection cut lens. - Liding Xu; Leo Liberti (Math. Program., 2025)