Leo Liberti
Publications
Publications
|
|
Unassigned distance geometry and the BuckminsterfullereneAIRO ODS2024 - Optimization and Decision Science, Massimo Di Francesco, Sep 2024, Badesi, Sardinia, Italy. pp.111-121, ⟨10.1007/978-3-031-90095-2_10⟩ |
|
|
Impact of Local Geometry on Methods for Constructing Protein Conformations19th Conference on Computer Science and Intelligence Systems (FedCSIS), ECMI Special Interest group Mathematics for Big Data and Artificial Intelligence, Sep 2024, Belgrade (Serbia), Serbia. pp.671-675 |
|
|
On syntactical graphs-of-wordsProceedings of Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Andreas Brieden; Stefan Pickl; Markus Siegle, Jun 2023, Garmisch-Partenkirchen, Germany |
|
|
Pseudo-dihedral Angles in Proteins Providing a New Description of the Ramachandran MapInternational Conference on Geometric Science of Information, Aug 2023, Saint-Malo, France. pp.511-519, ⟨10.1007/978-3-031-38299-4_53⟩ |
|
|
Collecting Data for Generating Distance Geometry Graphs for Protein Structure DeterminationROADEF 2023 - congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide, Feb 2023, Rennes, France |
|
|
Empirical comparison of semantic similarity measures for technical question answeringAdvances in Databases and Information Systems (ADBIS22), Sep 2022, Torino, Italy. ⟨10.1007/978-3-031-15743-1_16⟩ |
|
|
Are Random Projections really useful in Mathematical Programming?23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France |
|
|
Practical Performance of Random Projections in Linear ProgrammingSymposium on Experimental Algorithms, Jul 2022, Heidelberg, Germany. pp.21:1-21:15, ⟨10.4230/LIPIcs.SEA.2022.21⟩ |
|
|
Random projections for semidefinite programming *AIRO-ODS 2022, Aug 2022, Florence, Italy |
|
|
Random projections for the distance geometry problemDiscrete Mathematics Days, Jul 2022, Santander, Spain |
Urbain Air Mobility: Optimal Location of Safety Landing SitesCongrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, Apr 2021, Online, France |
|
|
|
A study on the impact of the distance types involved in protein structure determination by NMRBIBM 2021 - IEEE International Conference on Bioinformatics and Biomedicine, Dec 2021, Houston, United States. pp.1-9 |
Optimal Location of Safety Landing SitesEuropean Conference on Operational Research, 2021, Athens, Greece |
|
|
|
MD-JEEP: a New Release for Discretizable Distance Geometry Problems with Interval DataFedCSIS 2020 - 15th Conference on Computer Science and Information Systems, Sep 2020, Sofia, Bulgaria. pp.1-6 |
|
|
A New Distance Geometry Method for Constructing Word and Sentence VectorsWWW '20: The Web Conference 2020 (DL4G satellite workshop), 2020, Taipei, Taiwan. pp.679-685, ⟨10.1145/3366424.3391267⟩ |
|
|
MIP and Set Covering approaches for Sparse ApproximationROADEF -- congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2020, Montpellier, France |
Integer Formulation for Computing Transaction Aggregation to Detect Credit Card FraudCTW - Workshop on Graph Theory and Combinatorial Optimization, Sep 2020, Oline, Italy |
|
|
|
MIP and Set Covering approaches for Sparse ApproximationiTwist 2020 - International Traveling Workshop on Interactions between low-complexity data models and Sensing Techniques, Jun 2020, Nantes, France |
|
|
A Question Answering System For Interacting with SDMX DatabasesNLIWOD 2020 - 6th Natural Language Interfaces for the Web of Data / Workshop (in conjunction with ISWC), Nov 2020, Heraklion, Greece |
|
|
On aircraft deconfliction by bilevel programmingCologne-Twente Workshop on Graphs and Combinatorial Optimization, Jul 2019, Twente, Netherlands |
|
|
Random Projections for Quadratic Programs over a Euclidean BallInteger Programming and Combinatorial Optimization (IPCO), 2019, Ann Arbor, United States. pp.442-452, ⟨10.1007/978-3-030-17953-3_33⟩ |
|
|
Algorithmic configuration by learning and optimizationCologne-Twente Workshop on Graphs and Combinatorial Optimization, Jul 2019, Twente, Netherlands |
|
|
Globally Optimal Symbolic RegressionInterpretable ML, satellite workshop of NIPS 2017, 2017, Long Beach, United States |
Business Rule Sets as Programs: Turing-completeness and Structural Operational SemanticsTreizièmes Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA 2015), Jun 2015, Rennes, France |
|
|
|
A Mixed-integer Nonlinear Optimization Approach for Well Placement and GeometryECMOR XIV -14 th European Conference on the Mathematics of Oil Recovery, Sep 2014, Catania, Italy |
Adaptive Branching in iBP with Clifford AlgebraDistance Geometry and Applications (DGA13), Jun 2013, Manaus, Amazonas, Brazil. pp.65-69 |
|
|
|
Compact relaxations for polynomial programming problemsSEA 2012, 11th International Symposium on Experimental Algorithms, Jun 2012, Bordeaux, France. pp 75-86, ⟨10.1007/978-3-642-30850-5_8⟩ |
Finding Low-Energy Homopolymer Conformations by a Discrete ApproachGlobal Optimization Workshop 2012 (GOW12), 2012, Natal, Brazil |
|
Feasibility Pump algorithms for nonconvex Mixed Integer Nonlinear Programming problemsAPMOD 2012, Mar 2012, Germany |
|
Extending Feasibility Pump to nonconvex mixed integer nonlinear programming problemsROADEF 2012, Apr 2012, France |
|
On the Discretization of Distance Geometry ProblemsMathematics of Distances and Applications 2012 (MDA12), 2012, Varna, Bulgaria |
|
|
|
A MILP approach for designing robust variable-length codes based on exact free distance computationDCC 2012, Apr 2012, Snowbird, United States. pp.257 - 266, ⟨10.1109/DCC.2012.33⟩ |
|
|
On the composition of convex envelopes for quadrilinear termsCOSC 2011, International Conference on Optimization, Simulation and Control, Dec 2011, Berlin, Germany. pp xxxx |
A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry ProblemIEEE International Conference on Bioinformatics and Biomedicine, Nov 2011, Atlanta, United States |
|
|
|
Hierarchical clustering for the identification of communities in networksROADEF 2011, 12ème congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision, Mar 2011, St-Etienne, France |
|
|
Joint Decoding of Multiple-Description Network-Coded DataNETCOD 2011 - International Symposium on Network Coding, Jul 2011, Beijing, China |
A Parallel Version of the Branch & Prune Algorithm for the Molecular Distance Geometry ProblemComputer Systems and Applications (AICCSA), 2010 IEEE/ACS International Conference on, May 2010, Hammamet, Tunisia. ⟨10.1109/AICCSA.2010.5586983⟩ |
|
|
|
On the convergence of feasibility based bounds tighteningCTW 2010, 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2010, Cologne, Germany. pp xxxx |
|
|
Reduced RLT constraints for polynomial programmingEWMINLP10, European Workshop on Mixed Integer Nonlinear Programming, Apr 2010, Marseille, France. pp 205-207 |
|
|
The Reformulation-Optimization Software EngineICMS 2010, 3rd International Congress on Mathematical Software, Sep 2010, Kobe, Japan. pp 303-314, ⟨10.1007/978-3-642-15582-6_50⟩ |
Feasibility-Based Bounds Tightening via Fixed PointsCOCOA 2010, 4th Annual International Conference on Combinatorial Optimization and Applications, Dec 2010, Kailua-Kona, United States. pp 65-76, ⟨10.1007/978-3-642-17458-2_7⟩ |
|
|
|
Range reduction using fixed pointsROADEF 2010, 11ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2010, Toulouse, France |
|
|
Discussion about formulations and resolution techniques of electrical machine design problemsICEM 2010, XIX International Conference on Electrical Machines, Sep 2010, Rome, Italy. pp 1-5, ⟨10.1109/ICELMACH.2010.5607836⟩ |
|
|
Algorithms for network modularity maximizationROADEF 2010, 11ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2010, Toulouse, France |
|
|
A General Framework for Combined Module-and Scale-based Product Platform DesignSecond International Symposium on Engineering Systems, Jun 2009, Cambridge, United States |
|
|
Inferring Parameters in Genetic Regulatory NetworksLatin American Conference on Operational Research (CLAIO'08), 2008, Carthagène des Indes, Colombia |
|
|
Network reconstruction: a mathematical programming approachEuropean Conference on Complex Systems (ECCS'08), Sep 2008, Jerusalem, Israel |
Edge cover by bipartite subgraphs6th CTW Workshops, 2007, Enschende, Netherlands |
|
Edge cover by bipartite subgraphCTW'07, University of Twente, Enschede, Pays-Bas, Jan 2007, X, France. pp.2 |
|
|
|
Efficient edge-swapping heuristics for finding minimum fundamental cycle basesCologne-Twente Workshop, 2004, Menaggio, Italy. pp.15-29 |
|
|
The Isomap algorithm in distance geometry16th International Symposium on Experimental Algorithms (SEA 2017), 2017, London, United Kingdom. ⟨10.4230/LIPIcs.SEA.2017.5⟩ |
|
|
Characterization of the conformational space of intrinsically disordered proteinsXIIth International Conference NMR: a tool for biology, May 2022, Paris, France |
An Introduction to Distance Geometry applied to Molecular Geometry, 2017, 978-3-319-57183-6 |
|
Euclidean Distance Geometry: An Introduction, 2017, 978-3-319-60792-4 |
|
Distance Geometry: Theory, Methods and ApplicationsSpringer, pp.410, 2013 |
|
|
|
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization2009 |
|
|
Distance geometry with and without the graphGeometric Constraint Systems: Problems, Progress, Connections, and Emerging Applications, In press |
|
|
Decoding noisy messages: a method that just shouldn't workData Science and Optimization, Communications Series on Data Science and Optimization, Fields Institute, Toronto, In press |
|
|
Continuous Reformulation of Binary Variables, RevisitedMathematical Optimization Theory and Operations Research: Recent Trends, 1476, Springer International Publishing, pp.201-215, 2021, Communications in Computer and Information Science, ⟨10.1007/978-3-030-86433-0_14⟩ |
|
|
A Cycle-Based Formulation for the Distance Geometry ProblemGraphs and Combinatorial Optimization: from Theory to Applications, pp.93-106, 2021, ⟨10.1007/978-3-030-63072-0_8⟩ |
|
|
Learning to Configure Mathematical Programming Solvers by Mathematical ProgrammingLearning and Intelligent Optimization in Lecture Notes in Computer Science (LNCS), Springer, Cham, 12096, pp.377-389, 2020, ⟨10.1007/978-3-030-53552-0_34⟩ |
|
|
Flying safely by bilevel programmingAdvances in Optimization and Decision Science for Society, Services and Enterprises, 2020, ⟨10.1007/978-3-030-34960-8_18⟩ |
|
|
Geometry and Analogies: A Study and Propagation Method for Word RepresentationsStatistical Language and Speech Processing, pp.100-111, 2019, ⟨10.1007/978-3-030-31372-2_9⟩ |
|
|
Perspective Cuts for the ACOPF with GeneratorsNew Trends in Emerging Complex Real Life Problems ODS, Taormina, Italy, September 10–13, 2018, pp.451-461, 2018, 9783030004729 |
|
|
Open research areas in distance geometryOpen problems in optimization and data analysis, 2018, Springer Optimization and Its Applications, 978-3-319-99141-2. ⟨10.1007/978-3-319-99142-9_11⟩ |
|
|
Maximum Concurrent Flow with Incomplete DataCombinatorial Optimization 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers, pp.77-88, 2018, 978-3-319-96150-7. ⟨10.1007/978-3-319-96151-4_7⟩ |
|
|
Alternating Current Optimal Power Flow with Generator SelectionCombinatorial optimization 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers, pp.364-375, 2018, 978-3-319-96151-4 |
|
|
Mathematical Programming Bounds for Kissing NumbersOptimization and Decision Science: Methodologies and Applications (AIRO/ODS17), pp.213-222, 2017 |
|
|
Controlling Some Statistical Properties of Business Rules ProgramsLearning and Intelligent Optimization, pp.263-276, 2017 |
|
|
Distance Geometry in Linearizable NormsGeometric Science of Information Third International Conference, GSI 2017, Paris, France, November 7-9, 2017, Proceedings, pp.830-837, 2017, 978-3-319-68444-4. ⟨10.1007/978-3-319-68445-1_95⟩ |
Is the Distance Geometry Problem in NP?Antonio Mucherino and Carlile Lavor and Leo Liberti and Nelson Maculan. Distance Geometry: Theory, Methods, and Applications, Springer, pp.85-93, 2013, 978-1-4614-5127-3. ⟨10.1007/978-1-4614-5128-0_5⟩ |
|
A VNS-based Heuristic for Feature Selection in Data MiningTalbi, E-G. Hybrid Metaheuristics, Springer, pp.353-368, 2013 |
|
The Discretizable Molecular Distance Geometry Problem seems Easier on ProteinsMucherino, Antonio and Lavor, Carlile and Liberti, Leo and Maculan, Nelson. Distance Geometry: Theory, Methods and Applications, Springer, pp.47-60, 2013 |
|
|
|
On the composition of convex envelopes for quadrilinear termsOptimization, Simulation, and Control, Springer Verlag, pp 1-16, 2013, Springer Optimization and Its Applications, Volume 76, 978-1-4614-5130-3. ⟨10.1007/978-1-4614-5131-0_1⟩ |
|
|
Compact Relaxations for Polynomial Programming ProblemsExperimental Algorithms, 7276, Springer Berlin Heidelberg, pp.75-86, 2012, Lecture Notes in Computer Science, ⟨10.1007/978-3-642-30850-5_8⟩ |
|
|
Reformulations in Mathematical Programming: A Computational ApproachFoundations of Computational Intelligence, Vol. 3, 203, Springer, pp.153-234, 2009, Studies in Computational Intelligence, ⟨10.1007/978-3-642-01085-9_7⟩ |
|
|
On feasibility based bounds tightening2012 |
|
|
Mathematics with large language models as provers and verifiers2025 |
|
|
Relaxations for binary polynomial optimization via signed certificates2025 |
|
|
On Cutting Planes for Signomial Programming2023 |
|
|
Certified and accurate SDP bounds for the ACOPF problem2022 |
|
|
Optimal paths on the ocean2021 |
|
|
Power network design with line activity2021 |
|
|
Distance geometry for word embeddings2020 |
|
|
Chain of thoughts, Tree of thoughts and Retrieval Augmented thoughtsLIX, École Polytechnique. 2024 |
|
|
Domain-specific data gathering and exploitationLIX, École Polytechnique. 2024 |
|
|
Cataphora detection and resolution: Advancements and Challenges in Natural Language ProcessingLIX, École Polytechnique. 2024 |
A Branch-and-Prune Algorithm for the Sensor Network Localization Problem[Research Report] 2013 |
|
|
Reformulation and Convex Relaxation Techniques for Global OptimizationOperations Research [math.OC]. Imperial College London, 2004. English. ⟨NNT : ⟩ |
|
|
Algebraic foundations of invertible cellular automataFormal Languages and Automata Theory [cs.FL]. Università degli Studi di Torino / Université de Turin, 1997. English. ⟨NNT : ⟩ |
|
|
Reformulation techniques in Mathematical ProgrammingOther [cs.OH]. Université Paris Dauphine, 2007 |