Leo Liberti

According to our database1, Leo Liberti authored at least 189 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Random projections for conic programs.
CoRR, 2021

2020
On an SDP relaxation for kissing number.
Optim. Lett., 2020

The K-discretization and K-incident graphs for discretizable Distance Geometry.
Optim. Lett., 2020

Random projections for quadratic programs.
Math. Program., 2020

Algorithms and applications for a class of bilevel MILPs.
Discret. Appl. Math., 2020

MIP and Set Covering approaches for Sparse Approximation.
CoRR, 2020

A new algorithm for the <sup>K</sup>DMDGP subclass of Distance Geometry Problems.
CoRR, 2020

Cycle-based formulations in Distance Geometry.
CoRR, 2020

Mathematical programming formulations for the alternating current optimal power flow problem.
4OR, 2020

A New Distance Geometry Method for Constructing Word and Sentence Vectors.
Proceedings of the Companion of The 2020 Web Conference 2020, 2020

A Question Answering System for Interacting with SDMX Databases.
Proceedings of the Joint Proceedings of Workshops AI4LEGAL2020, 2020

A Learning-Based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers.
Proceedings of the Machine Learning, Optimization, and Data Science, 2020

Learning to Configure Mathematical Programming Solvers by Mathematical Programming.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

MD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

2019
Undecidability and hardness in mixed-integer nonlinear programming.
RAIRO Oper. Res., 2019

A mathematical programming formulation for the Hartree-Fock problem on open-shell systems.
Optim. Lett., 2019

QPLIB: a library of quadratic programming instances.
Math. Program. Comput., 2019

Systematic Exploration of Protein Conformational Space Using a Distance Geometry Approach.
J. Chem. Inf. Model., 2019

Gaussian random projections for Euclidean membership problems.
Discret. Appl. Math., 2019

On the polynomiality of finding KDMDGP re-orders.
Discret. Appl. Math., 2019

Minimal NMR distance information for rigidity of protein graphs.
Discret. Appl. Math., 2019

Preface.
Discret. Appl. Math., 2019

Realizing Euclidean distance matrices by sphere intersection.
Discret. Appl. Math., 2019

Distance Geometry and Data Science.
CoRR, 2019

Geometry and Analogies: A Study and Propagation Method for Word Representations.
Proceedings of the Statistical Language and Speech Processing, 2019

On the Observability of Smart Grids and Related Optimization Methods.
Proceedings of the Operations Research Proceedings 2019, 2019

Random Projections for Quadratic Programs over a Euclidean Ball.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
Barvinok's naive algorithm in Distance Geometry.
Oper. Res. Lett., 2018

Random Projections for Linear Programming.
Math. Oper. Res., 2018

Tuning interval Branch-and-Prune for protein structure determination.
J. Glob. Optim., 2018

A symmetry-based splitting strategy for discretizable distance geometry problems.
J. Glob. Optim., 2018

Preface: Special issue dedicated to Distance Geometry.
J. Glob. Optim., 2018

Complexity and inapproximability results for the Power Edge Set problem.
J. Comb. Optim., 2018

Shortest Path Problem variants for the Hydro Unit Commitment Problem.
Electron. Notes Discret. Math., 2018

Universality and prediction in business rules.
Comput. Intell., 2018

Alternating Current Optimal Power Flow with Generator Selection.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Maximum Concurrent Flow with Incomplete Data.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
An Introduction to Distance Geometry applied to Molecular Geometry
Springer Briefs in Computer Science, Springer, ISBN: 978-3-319-57182-9, 2017

Recent advances on the interval distance geometry problem.
J. Glob. Optim., 2017

Surrogate-based methods for black-box optimization.
Int. Trans. Oper. Res., 2017

A multiplicative weights update algorithm for MINLP.
EURO J. Comput. Optim., 2017

New Error Measures and Methods for Realizing Protein Graphs from Distance Data.
Discret. Comput. Geom., 2017

Orbital shrinking: Theory and applications.
Discret. Appl. Math., 2017

The Isomap Algorithm in Distance Geometry.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Controlling Some Statistical Properties of Business Rules Programs.
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

Distance Geometry in Linearizable Norms.
Proceedings of the Geometric Science of Information - Third International Conference, 2017

Euclidean Distance Geometry - an Introduction.
Springer undergraduate texts in mathematics and technology, Springer, ISBN: 978-3-319-60791-7, 2017

2016
Constraint qualification failure in action.
Oper. Res. Lett., 2016

The power edge set problem.
Networks, 2016

Six mathematical gems from the history of distance geometry.
Int. Trans. Oper. Res., 2016

Preface to the Special Issue on Many Faces of Distances.
Int. Trans. Oper. Res., 2016

Solving LP using random projections.
Electron. Notes Discret. Math., 2016

New methods for the Distance Geometry Problem.
Electron. Notes Discret. Math., 2016

Open research areas in distance geometry.
CoRR, 2016

Divisive heuristic for modularity density maximization.
Comput. Oper. Res., 2016

Twelve surveys in operations research.
Ann. Oper. Res., 2016

Controlling the Average Behavior of Business Rules Programs.
Proceedings of the Rule Technologies. Research, Tools, and Applications, 2016

The Learnability of Business Rules.
Proceedings of the Machine Learning, Optimization, and Big Data, 2016

Diagonally Dominant Programming in Distance Geometry.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Community detection with the weighted parsimony criterion.
J. Syst. Sci. Complex., 2015

An algorithm for realizing Euclidean distance matrices.
Electron. Notes Discret. Math., 2015

Discretization vertex orders in distance geometry.
Discret. Appl. Math., 2015

Using the Johnson-Lindenstrauss lemma in linear and integer programming.
CoRR, 2015

Optimization and sustainable development.
Comput. Manag. Sci., 2015

An algorithm to enumerate all possible protein conformations verifying a set of distance constraints.
BMC Bioinform., 2015

The dirty dozen of 4OR.
4OR, 2015

Simulation and optimization of energy efficient operation of HVAC system as demand response with distributed energy resources.
Proceedings of the 2015 Winter Simulation Conference, 2015

Distance Geometry on the Sphere.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Modelling Rank Constraints in Mathematical Programming.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Observing the State of a Smart Grid Using Bilevel Programming.
Proceedings of the Combinatorial Optimization and Applications, 2015

Orbital Independence in Symmetric Mathematical Programs.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Euclidean Distance Geometry and Applications.
SIAM Rev., 2014

On the Weber facility location problem with limited distances and side constraints.
Optim. Lett., 2014

Stabilizer-based symmetry breaking constraints for mathematical programs.
J. Glob. Optim., 2014

Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks.
ACM J. Exp. Algorithmics, 2014

Mathematical programming: Turing completeness and applications to software analysis.
J. Comb. Optim., 2014

On the number of realizations of certain Henneberg graphs arising in protein conformation.
Discret. Appl. Math., 2014

Improving heuristics for network modularity maximization using an exact algorithm.
Discret. Appl. Math., 2014

2013
A VNS-Based Heuristic for Feature Selection in Data Mining.
Proceedings of the Hybrid Metaheuristics, 2013

The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances.
J. Glob. Optim., 2013

Toulouse Global optimization Workshop 2010 (TOGO10).
J. Glob. Optim., 2013

A discrete search algorithm for finding the structure of protein backbones and side chains.
Int. J. Bioinform. Res. Appl., 2013

On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square.
Discret. Appl. Math., 2013

The Anonymous Subgraph Problem.
Comput. Oper. Res., 2013

A two-phase heuristic for the bottleneck <i>k</i>-hyperplane clustering problem.
Comput. Optim. Appl., 2013

Eleven surveys in operations research: III.
Ann. Oper. Res., 2013

Preface.
Ann. Oper. Res., 2013

The integration of Clifford Algebra in the iBP algorithm for the DMDGP.
Proceedings of the International Work-Conference on Bioinformatics and Biomedical Engineering, 2013

Counting the Number of Solutions of KDMDGP Instances.
Proceedings of the Geometric Science of Information - First International Conference, 2013

The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins.
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

Is the Distance Geometry Problem in NP?
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

2012
The discretizable distance geometry problem.
Optim. Lett., 2012

Discretization orders for distance geometry problems.
Optim. Lett., 2012

Bidirectional <i>A</i>* search on time-dependent road networks.
Networks, 2012

Reformulations in mathematical programming: automatic symmetry detection and exploitation.
Math. Program., 2012

A storm of feasibility pumps for nonconvex MINLP.
Math. Program., 2012

Preface.
Math. Program., 2012

An improved column generation algorithm for minimum sum-of-squares clustering.
Math. Program., 2012

A matroid view of key theorems for edge-swapping algorithms.
Math. Methods Oper. Res., 2012

Reduced RLT representations for nonconvex polynomial programming problems.
J. Glob. Optim., 2012

Exploiting Symmetry Properties of the Discretizable molecular Distance Geometry Problem.
J. Bioinform. Comput. Biol., 2012

Recent advances on the Discretizable Molecular Distance Geometry Problem.
Eur. J. Oper. Res., 2012

The discretizable molecular distance geometry problem.
Comput. Optim. Appl., 2012

Technological architecture evolutions of information systems: Trade-off and optimization.
Concurr. Eng. Res. Appl., 2012

No end of the world in 2012 for 4OR.
4OR, 2012

A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Compact Relaxations for Polynomial Programming Problems.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Orbital Shrinking.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Modularity maximization in networks by variable neighborhood search.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

A MILP Approach for Designing Robust Variable-Length Codes Based on Exact Free Distance Computation.
Proceedings of the 2012 Data Compression Conference, Snowbird, UT, USA, April 10-12, 2012, 2012

Modelling Rank Constraints in Mathematical Programming.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Invex Formulations of Unbounded Disjunctions.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Branching on Split Disjunctions.
Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

A recipe for finding good solutions to MINLPs.
Math. Program. Comput., 2011

Improved strategies for branching on general disjunctions.
Math. Program., 2011

On the computation of protein backbones by using artificial backbones of hydrogens.
J. Glob. Optim., 2011

Molecular distance geometry methods: from continuous to discrete.
Int. Trans. Oper. Res., 2011

A note on "A branch-and-prune algorithm for the molecular distance geometry problem".
Int. Trans. Oper. Res., 2011

8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009).
Discret. Appl. Math., 2011

Polynomial cases of the Discretizable Molecular Distance Geometry Problem
CoRR, 2011

Edge cover by connected bipartite subgraphs.
Ann. Oper. Res., 2011

Optimal recommender systems blending.
Proceedings of the International Conference on Web Intelligence, Mining and Semantics, 2011

Evaluation of Collaborative Filtering Algorithms Using a Small Dataset.
Proceedings of the WEBIST 2011, 2011

Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

The price of equity in the Hazmat.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Branch-and-Prune trees with bounded width.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Bound constraints for Point Packing in a Square.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem.
Proceedings of the Combinatorial Optimization and Applications, 2011

A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry Problem.
Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2011

UniALT for regular language contrained shortest paths on a multi-modal transportation network.
Proceedings of the ATMOS 2011, 2011

2010
A Good Recipe for Solving MINLPs.
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

On interval-subgradient and no-good cuts.
Oper. Res. Lett., 2010

On convex relaxations of quadrilinear terms.
J. Glob. Optim., 2010

Static Analysis by Abstract Interpretation: A Mathematical Programming Approach.
Electron. Notes Theor. Comput. Sci., 2010

Mathematical programming based debugging.
Electron. Notes Discret. Math., 2010

Formulation symmetries in circle packing.
Electron. Notes Discret. Math., 2010

Fast paths in large-scale dynamic road networks.
Comput. Optim. Appl., 2010

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems.
Proceedings of the Mathematical Software, 2010

The Reformulation-Optimization Software Engine.
Proceedings of the Mathematical Software, 2010

Optimal Technological Architecture Evolutions of Information Systems.
Proceedings of the Complex Systems Design & Management, 2010

Static Symmetry Breaking in Circle Packing.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

On the Convergence of Feasibility based Bounds Tightening.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Feasibility-Based Bounds Tightening via Fixed Points.
Proceedings of the Combinatorial Optimization and Applications, 2010

A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2009
Reformulations in Mathematical Programming: A Computational Approach.
Proceedings of the Foundations of Computational Intelligence, 2009

Reformulation-Linearization Technique for Global Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Molecular Distance Geometry Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Reformulations in Mathematical Programming: Definitions and Systematics.
RAIRO Oper. Res., 2009

Branching and bounds tighteningtechniques for non-convex MINLP.
Optim. Methods Softw., 2009

Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem.
Optim. Lett., 2009

Edge-swapping algorithms for the minimum fundamental cycle basis problem.
Math. Methods Oper. Res., 2009

Double variable neighbourhood search with smoothing for the molecular distance geometry problem.
J. Glob. Optim., 2009

Reformulation techniques in mathematical programming.
Discret. Appl. Math., 2009

Reformulation in mathematical programming: An application to quantum chemistry.
Discret. Appl. Math., 2009

On a discretizable subclass of instances of the molecular distance geometry problem.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Computing artificial backbones of hydrogen atoms in order to discover protein backbones.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2009

Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Combinatorial Optimization Based Recommender Systems.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Shortest paths on dynamic graphs.
Int. Trans. Oper. Res., 2008

A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem.
Int. Trans. Oper. Res., 2008

Spherical cuts for integer programming problems.
Int. Trans. Oper. Res., 2008

Bidirectional A<sup>*</sup> Search for Time-Dependent Fast Paths.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem.
Proceedings of the Modelling, 2008

Bidirectional <i>A</i><sup>*</sup> on Time-dependent Graphs.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Reformulations in Mathematical Programming: Definitions.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks.
Proceedings of the Combinatorial Optimization and Applications, 2008

Automatic Generation of Symmetry-Breaking Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2008

The Secret Santa Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
New formulations for the Kissing Number Problem.
Discret. Appl. Math., 2007

Compact linearization for binary quadratic problems.
4OR, 2007

Edge cover by bipartite subgraphs.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

Fast point-to-point shortest path queries on dynamic road networks with interfal data.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

A useful characterization of the feasible region of binary linear programs.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms.
J. Glob. Optim., 2006

Graphs and combinatorial optimization.
Discret. Optim., 2006

2005
Linearity Embedded in Nonconvex Programs.
J. Glob. Optim., 2005

Comparison of deterministic and stochastic approaches to global optimization.
Int. Trans. Oper. Res., 2005

2004
The Kissing Number Problem: A New Result from Global Optimization.
Electron. Notes Discret. Math., 2004

Preface.
Electron. Notes Discret. Math., 2004

Algorithms for finding minimum fundamental cycle bases in graphs.
Electron. Notes Discret. Math., 2004

Reformulation and convex relaxation techniques for global optimization.
4OR, 2004

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003
Convex Envelopes of Monomials of Odd Degree.
J. Glob. Optim., 2003

2002
Performance Comparison of Function Evaluation Methods
CoRR, 2002

1999
Structure of the Invertible CA Transformations Group.
J. Comput. Syst. Sci., 1999


  Loading...