Leo Liberti
132
Documents
Publications
|
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⟩
Conference papers
hal-04185420v1
|
|
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
Conference papers
hal-04006075v1
|
|
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⟩
Conference papers
hal-03795996v1
|
|
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
Conference papers
hal-03595252v1
|
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
Conference papers
hal-03647687v1
|
|
|
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
Conference papers
hal-03021075v1
|
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
Conference papers
hal-03542681v1
|
|
|
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⟩
Conference papers
hal-02869238v1
|
|
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
Conference papers
hal-03542690v1
|
|
Algorithmic configuration by learning and optimizationCologne-Twente Workshop on Graphs and Combinatorial Optimization, Jul 2019, Twente, Netherlands
Conference papers
hal-02350282v1
|
|
On aircraft deconfliction by bilevel programmingCologne-Twente Workshop on Graphs and Combinatorial Optimization, Jul 2019, Twente, Netherlands
Conference papers
hal-02350284v1
|
|
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⟩
Conference papers
hal-02869206v1
|
|
Globally Optimal Symbolic RegressionInterpretable ML, satellite workshop of NIPS 2017, 2017, Long Beach, United States
Conference papers
hal-02105286v1
|
|
The Isomap algorithm in distance geometry16th International Symposium on Experimental Algorithms (SEA 2017), 2017, London, United Kingdom. ⟨10.4230/LIPIcs.SEA.2017.5⟩
Conference papers
hal-02105293v1
|
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
Conference papers
hal-01178894v1
|
|
|
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
Conference papers
hal-02284385v1
|
Adaptive Branching in iBP with Clifford AlgebraDistance Geometry and Applications (DGA13), Jun 2013, Manaus, Amazonas, Brazil. pp.65-69
Conference papers
hal-00912698v1
|
|
|
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⟩
Conference papers
hal-00938524v1
|
|
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⟩
Conference papers
hal-00727540v1
|
Finding Low-Energy Homopolymer Conformations by a Discrete ApproachGlobal Optimization Workshop 2012 (GOW12), 2012, Natal, Brazil
Conference papers
hal-00756946v1
|
|
Extending Feasibility Pump to nonconvex mixed integer nonlinear programming problemsROADEF 2012, Apr 2012, France
Conference papers
hal-00758538v1
|
|
Feasibility Pump algorithms for nonconvex Mixed Integer Nonlinear Programming problemsAPMOD 2012, Mar 2012, Germany
Conference papers
hal-00758539v1
|
|
On the Discretization of Distance Geometry ProblemsMathematics of Distances and Applications 2012 (MDA12), 2012, Varna, Bulgaria
Conference papers
hal-00756945v1
|
|
|
Joint Decoding of Multiple-Description Network-Coded DataNETCOD 2011 - International Symposium on Network Coding, Jul 2011, Beijing, China
Conference papers
inria-00614545v1
|
|
On the composition of convex envelopes for quadrilinear termsCOSC 2011, International Conference on Optimization, Simulation and Control, Dec 2011, Berlin, Germany. pp xxxx
Conference papers
hal-00941976v1
|
|
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
Conference papers
hal-00934763v1
|
A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry ProblemIEEE International Conference on Bioinformatics and Biomedicine, Nov 2011, Atlanta, United States
Conference papers
inria-00637771v1
|
|
|
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
Conference papers
hal-00934795v1
|
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⟩
Conference papers
hal-00687531v1
|
|
|
On the convergence of feasibility based bounds tighteningCTW 2010, 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2010, Cologne, Germany. pp xxxx
Conference papers
hal-00940949v1
|
|
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⟩
Conference papers
hal-00938437v1
|
|
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
Conference papers
hal-00934772v1
|
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⟩
Conference papers
hal-00979219v1
|
|
|
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⟩
Conference papers
hal-00979214v1
|
|
Reduced RLT constraints for polynomial programmingEWMINLP10, European Workshop on Mixed Integer Nonlinear Programming, Apr 2010, Marseille, France. pp 205-207
Conference papers
hal-00938438v1
|
|
A General Framework for Combined Module-and Scale-based Product Platform DesignSecond International Symposium on Engineering Systems, Jun 2009, Cambridge, United States
Conference papers
hal-02561114v1
|
|
Inferring Parameters in Genetic Regulatory NetworksLatin American Conference on Operational Research (CLAIO'08), 2008, Carthagène des Indes, Colombia
Conference papers
hal-01217839v1
|
|
Network reconstruction: a mathematical programming approachEuropean Conference on Complex Systems (ECCS'08), Sep 2008, Jerusalem, Israel
Conference papers
hal-01217842v1
|
Edge cover by bipartite subgraphs6th CTW Workshops, 2007, Enschende, Netherlands
Conference papers
hal-00154162v1
|
|
Edge cover by bipartite subgraphCTW'07, University of Twente, Enschede, Pays-Bas, Jan 2007, X, France. pp.2
Conference papers
hal-01125267v1
|
|
|
Efficient edge-swapping heuristics for finding minimum fundamental cycle basesCologne-Twente Workshop, 2004, Menaggio, Italy. pp.15-29
Conference papers
hal-00163555v1
|
|
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⟩
Book sections
hal-03250704v1
|
|
Flying safely by bilevel programmingAdvances in Optimization and Decision Science for Society, Services and Enterprises, 2020, ⟨10.1007/978-3-030-34960-8_18⟩
Book sections
hal-02869682v1
|
|
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⟩
Book sections
hal-03030294v1
|
|
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⟩
Book sections
hal-02350281v1
|
|
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
Book sections
hal-02105081v1
|
|
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
Book sections
hal-02105077v1
|
|
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⟩
Book sections
hal-02105079v1
|
|
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⟩
Book sections
hal-02105082v1
|
|
Mathematical Programming Bounds for Kissing NumbersOptimization and Decision Science: Methodologies and Applications (AIRO/ODS17), pp.213-222, 2017
Book sections
hal-02105289v1
|
|
Controlling Some Statistical Properties of Business Rules ProgramsLearning and Intelligent Optimization, pp.263-276, 2017
Book sections
hal-02105297v1
|
|
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⟩
Book sections
hal-02105291v1
|
|
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⟩
Book sections
hal-00769671v1
|
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⟩
Book sections
hal-00782869v1
|
|
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
Book sections
hal-00912689v1
|
|
A VNS-based Heuristic for Feature Selection in Data MiningTalbi, E-G. Hybrid Metaheuristics, Springer, pp.353-368, 2013
Book sections
hal-00912692v1
|
|
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⟩
Book sections
hal-03554416v1
|
|
|
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⟩
Book sections
hal-01217899v1
|
|
On feasibility based bounds tightening2012
Other publications
hal-00935464v1
|
|
On Cutting Planes for Signomial Programming2023
Preprints, Working Papers, ...
hal-03646663v1
|
|
Submodular maximization and its generalization through an intersection cut lens2023
Preprints, Working Papers, ...
hal-04304919v1
|
|
Certified and accurate SDP bounds for the ACOPF problem2022
Preprints, Working Papers, ...
hal-03613385v1
|
|
Power network design with line activity2021
Preprints, Working Papers, ...
hal-03263306v1
|
|
Distance geometry for word embeddings2020
Preprints, Working Papers, ...
hal-02892020v1
|
A Branch-and-Prune Algorithm for the Sensor Network Localization Problem[Research Report] 2013
Reports
hal-00912710v1
|
|
Reformulation and Convex Relaxation Techniques for Global OptimizationOther [cs.OH]. Imperial College London, 2004. English. ⟨NNT : ⟩
Theses
hal-00163562v1
|
|
Fondamenti algebrici degli automi cellulari invertibiliFormal Languages and Automata Theory [cs.FL]. Università degli Studi di Torino / Université de Turin, 1997. Italian. ⟨NNT : ⟩
Theses
hal-00163561v1
|
|
Reformulation techniques in Mathematical ProgrammingOther [cs.OH]. Université Paris Dauphine, 2007
Habilitation à diriger des recherches
hal-00163563v1
|