
Leo Liberti
163
Documents
Publications
Publications
|
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
Communication dans un congrès
hal-04703256
v1
|
|
Unassigned distance geometry and the BuckminsterfullereneAIRO ODS2024 - Optimization and Decision Science, Massimo Di Francesco, Sep 2024, Badesi, Sardinia, Italy
Communication dans un congrès
hal-04747409
v1
|
|
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
Communication dans un congrès
hal-04185619
v1
|
|
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⟩
Communication dans un congrès
hal-04185420
v1
|
|
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
Communication dans un congrès
hal-04006075
v1
|
|
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
Communication dans un congrès
hal-03595252
v1
|
|
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⟩
Communication dans un congrès
hal-03795996
v1
|
|
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⟩
Communication dans un congrès
hal-03795867
v1
|
|
Random projections for semidefinite programming *AIRO-ODS 2022, Aug 2022, Florence, Italy
Communication dans un congrès
hal-03795941
v1
|
|
Random projections for the distance geometry problemDiscrete Mathematics Days, Jul 2022, Santander, Spain
Communication dans un congrès
hal-03795960
v1
|
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
Communication dans un congrès
hal-03647687
v1
|
|
|
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
Communication dans un congrès
hal-03636295
v1
|
Optimal Location of Safety Landing SitesEuropean Conference on Operational Research, 2021, Athens, Greece
Communication dans un congrès
hal-03351011
v1
|
|
|
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⟩
Communication dans un congrès
hal-02869238
v1
|
|
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
Communication dans un congrès
hal-03030154
v1
|
|
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
Communication dans un congrès
hal-03542690
v1
|
|
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
Communication dans un congrès
hal-03542681
v1
|
Integer Formulation for Computing Transaction Aggregation to Detect Credit Card FraudCTW - Workshop on Graph Theory and Combinatorial Optimization, Sep 2020, Oline, Italy
Communication dans un congrès
hal-03647579
v1
|
|
|
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
Communication dans un congrès
hal-03021075
v1
|
|
Algorithmic configuration by learning and optimizationCologne-Twente Workshop on Graphs and Combinatorial Optimization, Jul 2019, Twente, Netherlands
Communication dans un congrès
hal-02350282
v1
|
|
On aircraft deconfliction by bilevel programmingCologne-Twente Workshop on Graphs and Combinatorial Optimization, Jul 2019, Twente, Netherlands
Communication dans un congrès
hal-02350284
v1
|
|
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⟩
Communication dans un congrès
hal-02869206
v1
|
|
Globally Optimal Symbolic RegressionInterpretable ML, satellite workshop of NIPS 2017, 2017, Long Beach, United States
Communication dans un congrès
hal-02105286
v1
|
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
Communication dans un congrès
hal-01178894
v1
|
|
|
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
Communication dans un congrès
hal-02284385
v1
|
Adaptive Branching in iBP with Clifford AlgebraDistance Geometry and Applications (DGA13), Jun 2013, Manaus, Amazonas, Brazil. pp.65-69
Communication dans un congrès
hal-00912698
v1
|
|
|
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⟩
Communication dans un congrès
hal-00727540
v1
|
On the Discretization of Distance Geometry ProblemsMathematics of Distances and Applications 2012 (MDA12), 2012, Varna, Bulgaria
Communication dans un congrès
hal-00756945
v1
|
|
|
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⟩
Communication dans un congrès
hal-00938524
v1
|
Feasibility Pump algorithms for nonconvex Mixed Integer Nonlinear Programming problemsAPMOD 2012, Mar 2012, Germany
Communication dans un congrès
hal-00758539
v1
|
|
Extending Feasibility Pump to nonconvex mixed integer nonlinear programming problemsROADEF 2012, Apr 2012, France
Communication dans un congrès
hal-00758538
v1
|
|
Finding Low-Energy Homopolymer Conformations by a Discrete ApproachGlobal Optimization Workshop 2012 (GOW12), 2012, Natal, Brazil
Communication dans un congrès
hal-00756946
v1
|
|
A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry ProblemIEEE International Conference on Bioinformatics and Biomedicine, Nov 2011, Atlanta, United States
Communication dans un congrès
inria-00637771
v1
|
|
|
On the composition of convex envelopes for quadrilinear termsCOSC 2011, International Conference on Optimization, Simulation and Control, Dec 2011, Berlin, Germany. pp xxxx
Communication dans un congrès
hal-00941976
v1
|
|
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
Communication dans un congrès
hal-00934763
v1
|
|
Joint Decoding of Multiple-Description Network-Coded DataNETCOD 2011 - International Symposium on Network Coding, Jul 2011, Beijing, China
Communication dans un congrès
inria-00614545
v1
|
|
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
Communication dans un congrès
hal-00934772
v1
|
|
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⟩
Communication dans un congrès
hal-00938437
v1
|
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⟩
Communication dans un congrès
istex
hal-00979219
v1
|
|
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⟩
Communication dans un congrès
hal-00687531
v1
|
|
|
On the convergence of feasibility based bounds tighteningCTW 2010, 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2010, Cologne, Germany. pp xxxx
Communication dans un congrès
hal-00940949
v1
|
|
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⟩
Communication dans un congrès
hal-00979214
v1
|
|
Reduced RLT constraints for polynomial programmingEWMINLP10, European Workshop on Mixed Integer Nonlinear Programming, Apr 2010, Marseille, France. pp 205-207
Communication dans un congrès
hal-00938438
v1
|
|
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
Communication dans un congrès
hal-00934795
v1
|
|
A General Framework for Combined Module-and Scale-based Product Platform DesignSecond International Symposium on Engineering Systems, Jun 2009, Cambridge, United States
Communication dans un congrès
hal-02561114
v1
|
|
Network reconstruction: a mathematical programming approachEuropean Conference on Complex Systems (ECCS'08), Sep 2008, Jerusalem, Israel
Communication dans un congrès
hal-01217842
v1
|
|
Inferring Parameters in Genetic Regulatory NetworksLatin American Conference on Operational Research (CLAIO'08), 2008, Carthagène des Indes, Colombia
Communication dans un congrès
hal-01217839
v1
|
Edge cover by bipartite subgraphs6th CTW Workshops, 2007, Enschende, Netherlands
Communication dans un congrès
hal-00154162
v1
|
|
Edge cover by bipartite subgraphCTW'07, University of Twente, Enschede, Pays-Bas, Jan 2007, X, France. pp.2
Communication dans un congrès
hal-01125267
v1
|
|
|
Efficient edge-swapping heuristics for finding minimum fundamental cycle basesCologne-Twente Workshop, 2004, Menaggio, Italy. pp.15-29
Communication dans un congrès
hal-00163555
v1
|
|
The Isomap algorithm in distance geometry16th International Symposium on Experimental Algorithms (SEA 2017), 2017, London, United Kingdom. ⟨10.4230/LIPIcs.SEA.2017.5⟩
Communication dans un congrès
hal-02105293
v1
|
|
Characterization of the conformational space of intrinsically disordered proteinsXIIth International Conference NMR: a tool for biology, May 2022, Paris, France
Poster de conférence
hal-04545776
v1
|
Euclidean Distance Geometry: An Introduction, 2017, 978-3-319-60792-4
Ouvrages
hal-02105298
v1
|
|
An Introduction to Distance Geometry applied to Molecular Geometry, 2017, 978-3-319-57183-6
Ouvrages
hal-02105299
v1
|
|
Distance Geometry: Theory, Methods and ApplicationsSpringer, pp.410, 2013
Ouvrages
hal-00912679
v1
|
|
|
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization2009
Ouvrages
hal-01217897
v1
|
|
Distance geometry with and without the graphGeometric Constraint Systems: Problems, Progress, Connections, and Emerging Applications, In press
Chapitre d'ouvrage
hal-04747403
v1
|
|
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
Chapitre d'ouvrage
hal-03795902
v1
|
|
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⟩
Chapitre d'ouvrage
hal-03395333
v1
|
|
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⟩
Chapitre d'ouvrage
hal-03250704
v1
|
|
Flying safely by bilevel programmingAdvances in Optimization and Decision Science for Society, Services and Enterprises, 2020, ⟨10.1007/978-3-030-34960-8_18⟩
Chapitre d'ouvrage
hal-02869682
v1
|
|
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⟩
Chapitre d'ouvrage
hal-03030294
v1
|
|
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⟩
Chapitre d'ouvrage
hal-02350281
v1
|
|
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
Chapitre d'ouvrage
hal-02105081
v1
|
|
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
Chapitre d'ouvrage
hal-02105077
v1
|
|
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⟩
Chapitre d'ouvrage
hal-02105082
v1
|
|
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⟩
Chapitre d'ouvrage
hal-02105079
v1
|
|
Mathematical Programming Bounds for Kissing NumbersOptimization and Decision Science: Methodologies and Applications (AIRO/ODS17), pp.213-222, 2017
Chapitre d'ouvrage
hal-02105289
v1
|
|
Controlling Some Statistical Properties of Business Rules ProgramsLearning and Intelligent Optimization, pp.263-276, 2017
Chapitre d'ouvrage
hal-02105297
v1
|
|
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⟩
Chapitre d'ouvrage
hal-02105291
v1
|
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⟩
Chapitre d'ouvrage
istex
hal-00782869
v1
|
|
A VNS-based Heuristic for Feature Selection in Data MiningTalbi, E-G. Hybrid Metaheuristics, Springer, pp.353-368, 2013
Chapitre d'ouvrage
hal-00912692
v1
|
|
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
Chapitre d'ouvrage
hal-00912689
v1
|
|
|
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⟩
Chapitre d'ouvrage
hal-00769671
v1
|
|
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⟩
Chapitre d'ouvrage
hal-03554416
v1
|
|
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⟩
Chapitre d'ouvrage
hal-01217899
v1
|
|
On feasibility based bounds tightening2012
Autre publication scientifique
hal-00935464
v1
|
|
On Cutting Planes for Signomial Programming2023
Pré-publication, Document de travail
hal-03723024
v2
|
|
On Cutting Planes for Signomial Programming2023
Pré-publication, Document de travail
hal-03646663
v1
|
|
Certified and accurate SDP bounds for the ACOPF problem2022
Pré-publication, Document de travail
hal-03613385
v1
|
|
Power network design with line activity2021
Pré-publication, Document de travail
hal-03263306
v1
|
|
Optimal paths on the ocean2021
Pré-publication, Document de travail
hal-03404586
v1
|
|
Distance geometry for word embeddings2020
Pré-publication, Document de travail
hal-02892020
v1
|
|
Cataphora detection and resolution: Advancements and Challenges in Natural Language ProcessingLIX, École Polytechnique. 2024
Rapport
(rapport technique)
hal-04747642
v1
|
|
Chain of thoughts, Tree of thoughts and Retrieval Augmented thoughtsLIX, École Polytechnique. 2024
Rapport
(rapport technique)
hal-04748901
v1
|
|
Domain-specific data gathering and exploitationLIX, École Polytechnique. 2024
Rapport
(rapport technique)
hal-04748884
v1
|
A Branch-and-Prune Algorithm for the Sensor Network Localization Problem[Research Report] 2013
Rapport
(rapport de recherche)
hal-00912710
v1
|
|
Reformulation and Convex Relaxation Techniques for Global OptimizationOther [cs.OH]. Imperial College London, 2004. English. ⟨NNT : ⟩
Thèse
hal-00163562
v1
|
|
Fondamenti algebrici degli automi cellulari invertibiliFormal Languages and Automata Theory [cs.FL]. Università degli Studi di Torino / Université de Turin, 1997. Italian. ⟨NNT : ⟩
Thèse
hal-00163561
v1
|
|
Reformulation techniques in Mathematical ProgrammingOther [cs.OH]. Université Paris Dauphine, 2007
HDR
hal-00163563
v1
|
Chargement...
Chargement...