Leo Liberti spends much of his time researching Mathematical optimization, Combinatorics, Algorithm, Global optimization and Nonlinear programming. The concepts of his Mathematical optimization study are interwoven with issues in Type, Set and Computation. His studies deal with areas such as Point and Regular polygon as well as Set.
His research integrates issues of Discrete mathematics, Embedding and Euclidean geometry in his study of Combinatorics. Leo Liberti works mostly in the field of Algorithm, limiting it down to concerns involving Column generation and, occasionally, Centroid, Explained sum of squares, Cluster analysis and Column. His studies examine the connections between Global optimization and genetics, as well as such issues in Convex hull, with regards to Convex combination and Convex analysis.
The scientist’s investigation covers issues in Mathematical optimization, Combinatorics, Algorithm, Set and Discrete mathematics. In most of his Mathematical optimization studies, his work intersects topics such as Nonlinear programming. His Combinatorics study integrates concerns from other disciplines, such as Embedding, Convex analysis and Euclidean geometry.
In his research, Space is intimately related to Discretization, which falls under the overarching field of Algorithm. His study focuses on the intersection of Discrete mathematics and fields such as Euclidean distance with connections in the field of Euclidean space. His Global optimization research is multidisciplinary, incorporating elements of Variable and Applied mathematics.
His scientific interests lie mostly in Mathematical optimization, Algorithm, Set, Discrete mathematics and Euclidean geometry. Leo Liberti combines subjects such as Electrical grid and Alternating current with his study of Mathematical optimization. His Algorithm study combines topics from a wide range of disciplines, such as Discretization, Distance measurement, Interval and Combinatorial explosion.
His Discretization research includes themes of Euclidean space, Combinatorics, Solution set, Space and Symmetry. His work carried out in the field of Set brings together such families of science as Dual, Applied mathematics and Linear programming formulation. The various areas that Leo Liberti examines in his Discrete mathematics study include Norm, Sparse approximation, Dimension and Euclidean distance matrix.
His primary scientific interests are in Set, Quadratic equation, Euclidean geometry, Algorithm and Applied mathematics. His Set research includes elements of Space, Randomized algorithm, Dimension and Relaxation. His Quadratic equation research focuses on subjects like Quadratic programming, which are linked to Theoretical computer science, Optimization problem, Taxonomy and Theory of computation.
His Euclidean geometry research is multidisciplinary, incorporating perspectives in Discrete mathematics, Countable set, Almost surely and Point. His Discrete mathematics research incorporates themes from Intersection, Embedding and Euclidean space, Euclidean distance matrix. His Combinatorial explosion research extends to Algorithm, which is thematically connected.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Branching and bounds tighteningtechniques for non-convex MINLP
Pietro Belotti;Jon Lee;Leo Liberti;Francois Margot.
Optimization Methods & Software (2009)
Branching and bounds tighteningtechniques for non-convex MINLP
Pietro Belotti;Jon Lee;Leo Liberti;Francois Margot.
Optimization Methods & Software (2009)
Euclidean Distance Geometry and Applications
Leo Liberti;Carlile Lavor;Nelson Maculan;Antonio Mucherino.
Siam Review (2014)
Euclidean Distance Geometry and Applications
Leo Liberti;Carlile Lavor;Nelson Maculan;Antonio Mucherino.
Siam Review (2014)
A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem
Leo Liberti;Carlile Lavor;Nelson Maculan.
International Transactions in Operational Research (2008)
A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem
Leo Liberti;Carlile Lavor;Nelson Maculan.
International Transactions in Operational Research (2008)
The discretizable molecular distance geometry problem
Carlile Lavor;Leo Liberti;Nelson Maculan;Antonio Mucherino.
web science (2012)
The discretizable molecular distance geometry problem
Carlile Lavor;Leo Liberti;Nelson Maculan;Antonio Mucherino.
web science (2012)
Global optimization : from theory to implementation
Leo Liberti;Nelson Maculan.
(2006)
Global optimization : from theory to implementation
Leo Liberti;Nelson Maculan.
(2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
HEC Montréal
Polytechnic University of Milan
Polytechnique Montréal
Apple (United States)
University of Bologna
Carnegie Mellon University
Khalifa University
Blue River Technology
New Jersey Institute of Technology
University of Padua
National University of Singapore
University of Hong Kong
Lehigh University
University of California, Davis
Northeast Normal University
Environmental Protection Agency
US Forest Service
Sunnybrook Health Science Centre
Hospital Universitario La Paz
The University of Texas at Dallas
Radboud University Nijmegen
University of Western Australia
Martin Luther University Halle-Wittenberg
University of Huddersfield
University College London
City, University of London