Leo Liberti
Orcid: 0000-0003-3139-6821Affiliations:
- Ecole Polytechnique, LIX, Palaiseau, France
- IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA
- Imperial College London, Centre for Process Systems Engineering, UK (PhD)
According to our database1,
Leo Liberti
authored at least 213 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
2023
ACM J. Exp. Algorithmics, December, 2023
2022
SIAM J. Optim., 2022
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections.
J. Glob. Optim., 2022
J. Glob. Optim., 2022
Mathematical programming formulations for the alternating current optimal power flow problem.
Ann. Oper. Res., 2022
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022
Empirical Comparison of Semantic Similarity Measures for Technical Question Answering.
Proceedings of the New Trends in Database and Information Systems, 2022
2021
Oper. Res. Lett., 2021
J. Mach. Learn. Res., 2021
Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice.
J. Glob. Optim., 2021
J. Glob. Optim., 2021
Ann. Oper. Res., 2021
A New Algorithm for the <sup>K</sup>DMDGP Subclass of Distance Geometry Problems with Exact Distances.
Algorithmica, 2021
Pseudo-dihedral Angles in Proteins Providing a New Description of the Ramachandran Map.
Proceedings of the Geometric Science of Information - 6th International Conference, 2021
A study on the impact of the distance types involved in protein structure determination by NMR.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021
2020
Optim. Lett., 2020
CoRR, 2020
Proceedings of the Companion of The 2020 Web Conference 2020, 2020
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
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
RAIRO Oper. Res., 2019
A mathematical programming formulation for the Hartree-Fock problem on open-shell systems.
Optim. Lett., 2019
Systematic Exploration of Protein Conformational Space Using a Distance Geometry Approach.
J. Chem. Inf. Model., 2019
Discret. Appl. Math., 2019
Discret. Appl. Math., 2019
Discret. Appl. Math., 2019
Proceedings of the Statistical Language and Speech Processing, 2019
Proceedings of the Operations Research Proceedings 2019, 2019
Proceedings of the Integer Programming and Combinatorial Optimization, 2019
2018
J. Glob. Optim., 2018
J. Glob. Optim., 2018
J. Comb. Optim., 2018
Electron. Notes Discret. Math., 2018
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
2017
Springer Briefs in Computer Science, Springer, ISBN: 978-3-319-57182-9, 2017
Discret. Comput. Geom., 2017
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017
Proceedings of the Geometric Science of Information - Third International Conference, 2017
Springer undergraduate texts in mathematics and technology, Springer, ISBN: 978-3-319-60791-7, 2017
2016
Int. Trans. Oper. Res., 2016
Int. Trans. Oper. Res., 2016
Proceedings of the Rule Technologies. Research, Tools, and Applications, 2016
Proceedings of the Machine Learning, Optimization, and Big Data, 2016
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
2015
J. Syst. Sci. Complex., 2015
Electron. Notes Discret. Math., 2015
An algorithm to enumerate all possible protein conformations verifying a set of distance constraints.
BMC Bioinform., 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
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
Proceedings of the Combinatorial Optimization and Applications, 2015
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
Optim. Lett., 2014
J. Glob. Optim., 2014
ACM J. Exp. Algorithmics, 2014
J. Comb. Optim., 2014
On the number of realizations of certain Henneberg graphs arising in protein conformation.
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
2013
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
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
Comput. Optim. Appl., 2013
Proceedings of the International Work-Conference on Bioinformatics and Biomedical Engineering, 2013
Proceedings of the Geometric Science of Information - First International Conference, 2013
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013
2012
Reformulations in mathematical programming: automatic symmetry detection and exploitation.
Math. Program., 2012
Math. Program., 2012
Math. Methods Oper. Res., 2012
J. Glob. Optim., 2012
Exploiting Symmetry Properties of the Discretizable molecular Distance Geometry Problem.
J. Bioinform. Comput. Biol., 2012
Eur. J. Oper. Res., 2012
Technological architecture evolutions of information systems: Trade-off and optimization.
Concurr. Eng. Res. Appl., 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
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
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
Proceedings of the Combinatorial Optimization - Methods and Applications, 2011
J. Glob. Optim., 2011
Int. Trans. Oper. Res., 2011
A note on "A branch-and-prune algorithm for the molecular distance geometry problem".
Int. Trans. Oper. Res., 2011
Discret. Appl. Math., 2011
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
Proceedings of the Network Optimization - 5th International Conference, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
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
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010
Proceedings of the Proceeding of the Second International Workshop on Numerical and Symbolic Abstract Domains, 2010
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
Proceedings of the Mathematical Software, 2010
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
Proceedings of the Combinatorial Optimization and Applications, 2010
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 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
Proceedings of the Foundations of Computational Intelligence, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
RAIRO Oper. Res., 2009
Optim. Methods Softw., 2009
Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem.
Optim. Lett., 2009
Math. Methods Oper. Res., 2009
Double variable neighbourhood search with smoothing for the molecular distance geometry problem.
J. Glob. Optim., 2009
Discret. Appl. Math., 2009
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
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
Int. Trans. Oper. Res., 2008
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
Proceedings of the Combinatorial Optimization and Applications, 2008
Proceedings of the Combinatorial Optimization and Applications, 2008
Proceedings of the Algorithmic Aspects in Information and Management, 2008
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
J. Glob. Optim., 2006
2005
Int. Trans. Oper. Res., 2005
2004
Reformulation and Convex Relaxation Techniques for Global Optimization. (Techniques de reformulation et relaxation convexe pour l'optimisation globale).
PhD thesis, 2004
Electron. Notes Discret. Math., 2004
Electron. Notes Discret. Math., 2004
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
2002
1999
1997
Fondamenti algebrici degli automi cellulari invertibili. (Algebraic foundations of invertible cellular automata / Fondations algébriques des automates cellulaires inversibles).
MSc thesis, 1997