Skip to Main content
Number of documents

128

Leo Liberti's list of publications


Journal articles57 documents

  • Leo Liberti, Pierre-Louis Poirion, Ky Vu. Random projections for conic programs. Linear Algebra and its Applications, Elsevier, 2021, 626, pp.204-220. ⟨10.1016/j.laa.2021.06.010⟩. ⟨hal-03318771⟩
  • Martina Cerulli, Leo Liberti. Polynomial programming prevents aircraft (and other) conflicts. Operations Research Letters, Elsevier, 2021, ⟨10.1016/j.orl.2021.05.001⟩. ⟨hal-02971109v2⟩
  • Leo Liberti, Benedetto Manca. Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections. Journal of Global Optimization, Springer Verlag, 2021, ⟨10.1007/s10898-021-01047-6⟩. ⟨hal-03395326⟩
  • Ruobing Shen, Bo Tang, Leo Liberti, Claudia D’ambrosio, Stéphane Canu. Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice. Journal of Global Optimization, Springer Verlag, 2021, ⟨10.1007/s10898-021-01034-x⟩. ⟨hal-03250712⟩
  • Douglas Gonçalves, Carlile Lavor, Leo Liberti, Michael Souza. A New Algorithm for the kDMDGP Subclass of Distance Geometry Problems with Exact Distances. Algorithmica, Springer Verlag, 2021, ⟨10.1007/s00453-021-00835-6⟩. ⟨hal-03250716⟩
  • Phil Duxbury, Carlile Lavor, Leo Liberti, Luiz Leduino de Salles-Neto. Unassigned distance geometry and molecular conformation problems. Journal of Global Optimization, Springer Verlag, 2021, ⟨10.1007/s10898-021-01023-0⟩. ⟨hal-03250715⟩
  • Maurizio Bruglieri, Roberto Cordone, Leo Liberti. Maximum feasible subsystems of distance geometry constraints. Journal of Global Optimization, Springer Verlag, 2021, ⟨10.1007/s10898-021-01003-4⟩. ⟨hal-03250708⟩
  • Martina Cerulli, Claudia d'Ambrosio, Leo Liberti, Mercedes Pelegrín. Detecting and solving aircraft conflicts using bilevel programming. Journal of Global Optimization, Springer Verlag, 2021, ⟨10.1007/s10898-021-00997-1⟩. ⟨hal-02869699v3⟩
  • Gustavo Dias, Leo Liberti. Exploiting symmetries in mathematical programming via orbital independence. Annals of Operations Research, Springer Verlag, In press, ⟨10.1007/s10479-019-03145-x⟩. ⟨hal-02869231⟩
  • Dan Bienstock, Mauro Escobar, Claudio Gentile, Leo Liberti. Mathematical programming formulations for the alternating current optimal power flow problem. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2020, 18 (3), pp.249-292. ⟨10.1007/s10288-020-00455-w⟩. ⟨hal-03030149⟩
  • Leo Liberti. Distance geometry and data science. TOP, Springer Verlag, In press, 28, pp.271-339. ⟨10.1007/s11750-020-00563-0⟩. ⟨hal-02869235⟩
  • Claudia D’ambrosio, Leo Liberti, Pierre-Louis Poirion, Ky Vu. Random projections for quadratic programs. Mathematical Programming, Springer Verlag, In press, 183, pp.619-647. ⟨10.1007/s10107-020-01517-x⟩. ⟨hal-02869240⟩
  • Pierre-Louis Poirion, Sónia Toubaline, Claudia d'Ambrosio, Leo Liberti. Algorithms and applications for a class of bilevel MILPs. Discrete Applied Mathematics, Elsevier, 2020, ⟨10.1016/j.dam.2018.02.015⟩. ⟨hal-02322719⟩
  • Jon Lee, Leo Liberti. On an SDP relaxation for kissing number. Optimization Letters, Springer Verlag, 2020, 14 (2), pp.417-422. ⟨10.1007/s11590-018-1239-9⟩. ⟨hal-02869223⟩
  • Leo Liberti, Carlile Lavor, Nelson Maculan. A mathematical programming formulation for the Hartree–Fock problem on open-shell systems. Optimization Letters, Springer Verlag, 2019, 13 (2), pp.429-437. ⟨10.1007/s11590-019-01386-0⟩. ⟨hal-02104828⟩
  • Ky Vu, Pierre-Louis Poirion, Leo Liberti. Gaussian random projections for Euclidean membership problems. Discrete Applied Mathematics, Elsevier, 2019, 253, pp.93-102. ⟨10.1016/j.dam.2018.08.025⟩. ⟨hal-02105075⟩
  • Leo Liberti. Undecidability and hardness in mixed-integer nonlinear programming. RAIRO - Operations Research, EDP Sciences, 2019, 53 (1), pp.81-109. ⟨10.1051/ro/2018036⟩. ⟨hal-02104836⟩
  • Thérèse E Malliavin, Antonio Mucherino, Carlile Lavor, Leo Liberti. Systematic Exploration of Protein Conformational Space Using a Distance Geometry Approach. Journal of Chemical Information and Modeling, American Chemical Society, 2019, 59 (10), pp.4486-4503. ⟨10.1021/acs.jcim.9b00215⟩. ⟨hal-02350285⟩
  • Jorge Alencar, Carlile Lavor, Leo Liberti. Realizing Euclidean distance matrices by sphere intersection. Discrete Applied Mathematics, Elsevier, 2019, 256, pp.5-10. ⟨10.1016/j.dam.2018.06.003⟩. ⟨hal-02350274⟩
  • Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros Gleixner, et al.. QPLIB: a library of quadratic programming instances. Mathematical Programming Computation, 2019, 11 (2), ⟨10.1007/s12532-018-0147-4⟩. ⟨hal-02177672⟩
  • Claudia D’ambrosio, Jon R. Lee, Leo Liberti, Maks Ovsjanikov. Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization. Optimization and Engineering, Springer Verlag, 2019, 20 (2), pp.337-347. ⟨10.1007/s11081-018-9405-6⟩. ⟨hal-02350272⟩
  • Carlile Lavor, Michael Souza, Luiz Mariano Carvalho, Leo Liberti. On the polynomiality of finding K DMDGP re-orders. Discrete Applied Mathematics, Elsevier, 2019, 267, pp.190-194. ⟨10.1016/j.dam.2019.07.021⟩. ⟨hal-02350277⟩
  • Carlile Lavor, Leo Liberti, Bruce Donald, Bradley Worley, Benjamin Bardiaux, et al.. Minimal NMR distance information for rigidity of protein graphs. Discrete Applied Mathematics, Elsevier, 2019, 256, pp.91-104. ⟨10.1016/j.dam.2018.03.071⟩. ⟨hal-01907200v2⟩
  • Bradley Worley, Florent Delhommel, Florence Cordier, Thérèse Malliavin, Benjamin Bardiaux, et al.. Tuning interval Branch-and-Prune for protein structure determination. Journal of Global Optimization, Springer Verlag, 2018, 72 (1), pp.109-127. ⟨10.1007/s10898-018-0635-0⟩. ⟨pasteur-01921275v2⟩
  • Sonia Toubaline, Claudia d'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, et al.. Complexity and inapproximability results for the Power Edge Set problem. Journal of Combinatorial Optimization, Springer Verlag, 2018, 35 (3), pp.895-905. ⟨10.1007/s10878-017-0241-y⟩. ⟨hal-02105288⟩
  • Olivier Wang, Christian de Sainte Marie, Changhai Ke, Leo Liberti. Universality and prediction in business rules. Computational Intelligence, Wiley, 2018, 34 (2), pp.763-785. ⟨10.1111/coin.12174⟩. ⟨hal-02105086⟩
  • Ky Vu, Pierre-Louis Poirion, Leo Liberti. Random Projections for Linear Programming. Mathematics of Operations Research, INFORMS, 2018, 43 (4), pp.1051-1071. ⟨10.1287/moor.2017.0894⟩. ⟨hal-02105076⟩
  • Leo Liberti, Ky Vu. Barvinok’s naive algorithm in Distance Geometry. Operations Research Letters, Elsevier, 2018, 46 (5), pp.476-481. ⟨10.1016/j.orl.2018.06.006⟩. ⟨hal-02105083⟩
  • Wim van Ackooij, Claudia d'Ambrosio, Leo Liberti, Raouia Taktak, Dimitri Thomopulos, et al.. Shortest Path Problem variants for the Hydro Unit Commitment Problem. Electronic Notes in Discrete Mathematics, 2018, 69, ⟨10.1016/j.endm.2018.07.040⟩. ⟨hal-02098485⟩
  • Sónia Toubaline, Claudia D’ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, et al.. Complexity and inapproximability results for the Power Edge Set problem. Journal of Combinatorial Optimization, Springer Verlag, 2018, 35 (3), ⟨10.1007/s10878-017-0241-y⟩. ⟨hal-01743251⟩
  • Felipe Fidalgo, Douglas Gonçalves, Carlile Lavor, Leo Liberti, Antonio Mucherino. A symmetry-based splitting strategy for discretizable distance geometry problems. Journal of Global Optimization, Springer Verlag, 2018, 71 (4), pp.717-733. ⟨10.1007/s10898-018-0610-9⟩. ⟨hal-02105087⟩
  • Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino. The K-discretization and K-incident graphs for discretizable Distance Geometry. Optimization Letters, Springer Verlag, 2018, 14 (2), pp.1-14. ⟨10.1007/s11590-018-1294-2⟩. ⟨hal-01826217⟩
  • Luca Mencarelli, Youcef Sahraoui, Leo Liberti. A multiplicative weights update algorithm for MINLP. EURO Journal on Computational Optimization, Springer, 2017, 5 (1-2), pp.31-86. ⟨10.1007/s13675-016-0069-8⟩. ⟨hal-02105301⟩
  • Ky Khac Vu, Claudia d'Ambrosio, Youssef Hamadi, Leo Liberti. Surrogate-based methods for black-box optimization. International Transactions in Operational Research, Wiley, 2017, 24 (3), pp.393-424. ⟨10.1111/itor.12292⟩. ⟨hal-02105302⟩
  • Douglas Gonçalves, Antonio Mucherino, Carlile Lavor, Leo Liberti. Recent advances on the interval distance geometry problem. Journal of Global Optimization, Springer Verlag, 2017, 69 (3), pp.525-545. ⟨10.1007/s10898-016-0493-6⟩. ⟨hal-02105295⟩
  • Claudia D’ambrosio, Ky Khac Vu, Carlile Lavor, Leo Liberti, Nelson Maculan. New Error Measures and Methods for Realizing Protein Graphs from Distance Data. Discrete and Computational Geometry, Springer Verlag, 2017, 57 (2), pp.371-418. ⟨10.1007/s00454-016-9846-7⟩. ⟨hal-02105303⟩
  • Sonia Cafieri, Pierre Hansen, Leo Liberti. Improving heuristics for network modularity maximization using an exact algorithm. Discrete Applied Mathematics, Elsevier, 2014, 163 (1), pp 65-72. ⟨10.1016/j.dam.2012.03.030⟩. ⟨hal-00935211⟩
  • Leo Liberti, Carlile Lavor, Nelson Maculan, Antonio Mucherino. Euclidean Distance Geometry and Applications. SIAM Review, Society for Industrial and Applied Mathematics, 2014, 56 (1), pp.3-69. ⟨hal-01093056⟩
  • Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino. On the Number of Realizations of Certain Henneberg Graphs arising in Protein Conformation. Discrete Applied Mathematics, Elsevier, 2014, 165, pp.213-232. ⟨hal-01093060⟩
  • Andrea Cassioli, Benjamin Bardiaux, Guillaume Bouvier, Antonio Mucherino, Rafael Alves, et al.. An algorithm to enumerate all possible protein conformations verifying a set of distance constraints. BMC Bioinformatics, BioMed Central, 2014, 16 (1), pp.23. ⟨10.1186/s12859-015-0451-1⟩. ⟨pasteur-01120652⟩
  • Sonia Cafieri, Leo Liberti, Frédéric Messine, Bertrand Nogarède. Optimal design of electrical machines : mathematical programming formulations. COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, Emerald, 2013, 32 (3), pp 977-996. ⟨10.1108/03321641311305863⟩. ⟨hal-00934665⟩
  • Carlile Lavor, Leo Liberti, Antonio Mucherino. The interval Branch & Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances. Journal of Global Optimization, Springer Verlag, 2013, 56 (3), pp.855-871. ⟨hal-00912660⟩
  • Claudia d'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi. A Storm of Feasibility Pumps for Nonconvex MINLP. Mathematical Programming, Springer Verlag, 2012, 136 (2), pp.375-402. ⟨10.1007/s10107-012-0608-x⟩. ⟨hal-00758042⟩
  • Antonio Mucherino, Carlile Lavor, Lee Jon, John Lee S., Leo Liberti, et al.. Discretization Orders for Distance Geometry Problems. Optimization Letters, Springer Verlag, 2012, 6 (4), pp.783-796. ⟨10.1007/s11590-011-0302-6⟩. ⟨hal-00756941⟩
  • Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan. Recent Advances on the Discretizable Molecular Distance Geometry Problem. European Journal of Operational Research, Elsevier, 2012, 219, pp.698-706. ⟨hal-00756942⟩
  • Antonio Mucherino, Carlile Lavor, Leo Liberti. Exploiting Symmetry Properties of the Discretizable Molecular Distance Geometry Problem. Journal of Bioinformatics and Computational Biology, World Scientific Publishing, 2012, 10 (3), pp.1242009(1-15). ⟨hal-00756939⟩
  • Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda. Technological architecture evolutions of information systems: Trade-off and optimization. Concurrent Engineering: Research and Applications, SAGE Publications, 2012, 20(2), pp.127--147. ⟨hal-00999308⟩
  • Antonio Mucherino, Carlile Lavor, Leo Liberti. The Discretizable Distance Geometry Problem. Optimization Letters, Springer Verlag, 2012, 6 (8), pp.1671-1686. ⟨10.1007/s11590-011-0358-3⟩. ⟨hal-00756943⟩
  • Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan. The Discretizable Molecular Distance Geometry Problem. Computational Optimization and Applications, Springer Verlag, 2012, 24th International Federation for Information Processing-7th Technical Committee Conference on System Modeling and Optimization Jul 2009 Buenos Aires, 52, pp.115-146. ⟨10.1007/s10589-011-9402-6⟩. ⟨hal-00756940⟩
  • Sonia Cafieri, Pierre Hansen, Leo Liberti. Locally optimal heuristic for modularity maximization of networks. Physical Review E : Statistical, Nonlinear, and Soft Matter Physics, American Physical Society, 2011, 83 (5), pp 056105-1 - 056105-8. ⟨10.1103/PhysRevE.83.056105⟩. ⟨hal-00934660⟩
  • Sonia Cafieri, Pierre Hansen, Leo Liberti. Loops and multiple edges in modularity maximization of networks. Physical Review E : Statistical, Nonlinear, and Soft Matter Physics, American Physical Society, 2010, 81 (4), pp 046102. ⟨10.1103/PhysRevE.81.046102⟩. ⟨hal-00979205⟩
  • Daniel Aloise, Sonia Cafieri, Gilles Caporossi, Pierre Hansen, Leo Liberti, et al.. Column generation algorithms for exact modularity maximization in networks. Physical Review E : Statistical, Nonlinear, and Soft Matter Physics, American Physical Society, 2010, 82 (4), pp 046112-1 - 046112-9. ⟨10.1103/PhysRevE.82.046112⟩. ⟨hal-00934661⟩
  • Sonia Cafieri, Pierre Hansen, Leo Liberti. Edge ratio and community structure in networks. Physical Review E : Statistical, Nonlinear, and Soft Matter Physics, American Physical Society, 2010, 81 (2), pp 026105. ⟨10.1103/PhysRevE.81.026105⟩. ⟨hal-00935207⟩
  • Leo Liberti. Solving Hartree-Fock systems with global optimization metohds. EPL - Europhysics Letters, European Physical Society/EDP Sciences/Società Italiana di Fisica/IOP Publishing, 2007, 77 (5), 50006p1-50006p5. ⟨hal-00152406⟩
  • Leo Liberti, Pietro Belotti, Sergei Kucherenko, Nelson Maculan. New formulations for the Kissing Number Problem. Discrete Applied Mathematics, Elsevier, 2007, 155 (4), pp.1837-1841. ⟨inria-00123758⟩
  • Leo Liberti. Reformulation and Convex Relaxation Techniques for Global Optimization. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2004, 2, pp.255-258. ⟨hal-00152397⟩
  • C.C. Pantelides, Leo Liberti, P. Tsiakis, T. Crombie. MINLP Interface Specification. CAPE-OPEN Update, 2002, 2, pp.10-13. ⟨hal-00163564⟩

Conference papers38 documents

  • Leo Liberti. 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. ⟨hal-03595252⟩
  • Liding Xu, Sonia Haddad-Vanier, Claudia d'Ambrosio, Leo Liberti. Urbain Air Mobility: Optimal Location of Safety Landing Sites. Congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, Apr 2021, Online, France. ⟨hal-03647687⟩
  • Leo Liberti. A New Distance Geometry Method for Constructing Word and Sentence Vectors. WWW '20: The Web Conference 2020 (DL4G satellite workshop), 2020, Taipei, Taiwan. pp.679-685, ⟨10.1145/3366424.3391267⟩. ⟨hal-02869238⟩
  • Diego Delle Donne, Matthieu Kowalski, Leo Liberti. MIP and Set Covering approaches for Sparse Approximation. ROADEF -- congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2020, Montpellier, France. ⟨hal-03542690⟩
  • Diego Delle Donne, Matthieu Kowalski, Leo Liberti. MIP and Set Covering approaches for Sparse Approximation. iTwist 2020 - International Traveling Workshop on Interactions between low-complexity data models and Sensing Techniques, Jun 2020, Nantes, France. ⟨hal-03542681⟩
  • Guillaume Thiry, Ioana Manolescu, Leo Liberti. A Question Answering System For Interacting with SDMX Databases. NLIWOD 2020 - 6th Natural Language Interfaces for the Web of Data / Workshop (in conjunction with ISWC), Nov 2020, Heraklion, Greece. ⟨hal-03021075⟩
  • Ky Vu, Pierre-Louis Poirion, Claudia D’ambrosio, Leo Liberti. Random Projections for Quadratic Programs over a Euclidean Ball. Integer Programming and Combinatorial Optimization (IPCO), 2019, Ann Arbor, United States. pp.442-452, ⟨10.1007/978-3-030-17953-3_33⟩. ⟨hal-02869206⟩
  • Gabriele Iommazzo, Claudia d'Ambrosio, Antonio Frangioni, Leo Liberti. Algorithmic configuration by learning and optimization. Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jul 2019, Twente, Netherlands. ⟨hal-02350282⟩
  • Martina Cerulli, Claudia d'Ambrosio, Leo Liberti. On aircraft deconfliction by bilevel programming. Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jul 2019, Twente, Netherlands. ⟨hal-02350284⟩
  • Leo Liberti, Claudia d'Ambrosio. The Isomap algorithm in distance geometry. 16th International Symposium on Experimental Algorithms (SEA 2017), 2017, London, United Kingdom. ⟨10.4230/LIPIcs.SEA.2017.5⟩. ⟨hal-02105293⟩
  • Vernon Austel, Sanjeeb Dash, Oktay Gunluk, Lior Horesh, Leo Liberti, et al.. Globally Optimal Symbolic Regression. Interpretable ML, satellite workshop of NIPS 2017, 2017, Long Beach, United States. ⟨hal-02105286⟩
  • Olivier Wang, Changhai Ke, Leo Liberti, Christian de Sainte Marie. Business Rule Sets as Programs: Turing-completeness and Structural Operational Semantics. Treizièmes Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA 2015), Jun 2015, Rennes, France. ⟨hal-01178894⟩
  • C Lizon, C d'Ambrosio, Leo Liberti, Mickaële Le Ravalec, Delphine Sinoquet. A Mixed-integer Nonlinear Optimization Approach for Well Placement and Geometry. ECMOR XIV -14 th European Conference on the Mathematics of Oil Recovery, Sep 2014, Catania, Italy. ⟨hal-02284385⟩
  • Rafael Alves, Andrea Cassioli, Antonio Mucherino, Carlile Lavor, Leo Liberti. Adaptive Branching in iBP with Clifford Algebra. Distance Geometry and Applications (DGA13), Jun 2013, Manaus, Amazonas, Brazil. pp.65-69. ⟨hal-00912698⟩
  • Hassan Hijazi, Amadou Diallo, Michel Kieffer, Leo Liberti, Claudio Weidmann. A MILP approach for designing robust variable-length codes based on exact free distance computation. DCC 2012, Apr 2012, Snowbird, United States. pp.257 - 266, ⟨10.1109/DCC.2012.33⟩. ⟨hal-00727540⟩
  • Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan. On the Discretization of Distance Geometry Problems. Mathematics of Distances and Applications 2012 (MDA12), 2012, Varna, Bulgaria. ⟨hal-00756945⟩
  • Claudia d'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi. Extending Feasibility Pump to nonconvex mixed integer nonlinear programming problems. ROADEF 2012, Apr 2012, France. ⟨hal-00758538⟩
  • Claudia d'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi. Feasibility Pump algorithms for nonconvex Mixed Integer Nonlinear Programming problems. APMOD 2012, Mar 2012, Germany. ⟨hal-00758539⟩
  • Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan. Finding Low-Energy Homopolymer Conformations by a Discrete Approach. Global Optimization Workshop 2012 (GOW12), 2012, Natal, Brazil. ⟨hal-00756946⟩
  • Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine. Compact relaxations for polynomial programming problems. SEA 2012, 11th International Symposium on Experimental Algorithms, Jun 2012, Bordeaux, France. pp 75-86, ⟨10.1007/978-3-642-30850-5_8⟩. ⟨hal-00938524⟩
  • Antonio Mucherino, Carlile Lavor, Leo Liberti. A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry Problem. IEEE International Conference on Bioinformatics and Biomedicine, Nov 2011, Atlanta, United States. ⟨inria-00637771⟩
  • Sonia Cafieri, Pierre Hansen, Leo Liberti. Hierarchical clustering for the identification of communities in networks. ROADEF 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. ⟨hal-00934763⟩
  • Lana Iwaza, Michel Kieffer, Leo Liberti, Khaldoun Al Agha. Joint Decoding of Multiple-Description Network-Coded Data. NETCOD 2011 - International Symposium on Network Coding, Jul 2011, Beijing, China. ⟨inria-00614545⟩
  • Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti, Andrew Miller. On the composition of convex envelopes for quadrilinear terms. COSC 2011, International Conference on Optimization, Simulation and Control, Dec 2011, Berlin, Germany. pp xxxx. ⟨hal-00941976⟩
  • Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti. Feasibility-Based Bounds Tightening via Fixed Points. COCOA 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⟩. ⟨hal-00979219⟩
  • Leo Liberti, Sonia Cafieri, Jon Lee. Range reduction using fixed points. ROADEF 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. ⟨hal-00934795⟩
  • Daniel Aloise, Sonia Cafieri, Gilles Caporossi, Pierre Hansen, Leo Liberti, et al.. Algorithms for network modularity maximization. ROADEF 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. ⟨hal-00934772⟩
  • Sonia Cafieri, Leo Liberti, Frédéric Messine, Bertrand Nogarède. Discussion about formulations and resolution techniques of electrical machine design problems. ICEM 2010, XIX International Conference on Electrical Machines, Sep 2010, Rome, Italy. pp 1-5, ⟨10.1109/ICELMACH.2010.5607836⟩. ⟨hal-00938437⟩
  • Leo Liberti, Sonia Cafieri, David Savourey. The Reformulation-Optimization Software Engine. ICMS 2010, 3rd International Congress on Mathematical Software, Sep 2010, Kobe, Japan. pp 303-314, ⟨10.1007/978-3-642-15582-6_50⟩. ⟨hal-00979214⟩
  • Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine. Reduced RLT constraints for polynomial programming. EWMINLP10, European Workshop on Mixed Integer Nonlinear Programming, Apr 2010, Marseille, France. pp 205-207. ⟨hal-00938438⟩
  • Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti. On the convergence of feasibility based bounds tightening. CTW 2010, 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2010, Cologne, Germany. pp xxxx. ⟨hal-00940949⟩
  • Antonio Mucherino, Carlile Lavor, Leo Liberti, Talbi El-Ghazali. A Parallel Version of the Branch & Prune Algorithm for the Molecular Distance Geometry Problem. Computer Systems and Applications (AICCSA), 2010 IEEE/ACS International Conference on, May 2010, Hammamet, Tunisia. ⟨10.1109/AICCSA.2010.5586983⟩. ⟨hal-00687531⟩
  • Fabrizio Marinelli, Olivier de Weck, Daniel Krob, Leo Liberti. A General Framework for Combined Module-and Scale-based Product Platform Design. Second International Symposium on Engineering Systems, Jun 2009, Cambridge, United States. ⟨hal-02561114⟩
  • Camilo La Rota, Fabien Tarissan, Leo Liberti. Inferring Parameters in Genetic Regulatory Networks. Latin American Conference on Operational Research (CLAIO'08), 2008, Carthagène des Indes, Colombia. ⟨hal-01217839⟩
  • Fabien Tarissan, Leo Liberti, Camilo La Rota. Network reconstruction: a mathematical programming approach. European Conference on Complex Systems (ECCS'08), Sep 2008, Jerusalem, Israel. ⟨hal-01217842⟩
  • Marie-Chirstine Plateau, Leo Liberti, Laurent Alfandari. Edge cover by bipartite subgraphs. 6th CTW Workshops, 2007, Enschende, Netherlands. ⟨hal-00154162⟩
  • Marie-Christine Plateau, Leo Liberti, Laurent Alfandari. Edge cover by bipartite subgraph. CTW'07, University of Twente, Enschede, Pays-Bas, Jan 2007, X, France. pp.2. ⟨hal-01125267⟩
  • E. Amaldi, Leo Liberti, N. Maculan, F. Maffioli. Efficient edge-swapping heuristics for finding minimum fundamental cycle bases. 2004, pp.15-29. ⟨hal-00163555⟩

Books5 documents

  • Leo Liberti, Carlile Lavor. Euclidean Distance Geometry: An Introduction. 2017, 978-3-319-60792-4. ⟨hal-02105298⟩
  • Carlile Lavor, Leo Liberti, Weldon Lodwick, Tiago Mendonça da Costa. An Introduction to Distance Geometry applied to Molecular Geometry. 2017, 978-3-319-57183-6. ⟨hal-02105299⟩
  • Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan. Distance Geometry: Theory, Methods and Applications. Springer, pp.410, 2013. ⟨hal-00912679⟩
  • Leo Liberti. Reformulation and Convex Relaxation Techniques for Global Optimization. 2004. ⟨hal-00163562⟩
  • Leo Liberti. Fondamenti Algebrici degli Automi Cellulari Invertibili. M.Sc.~Thesis (in Italian), Dip. di Matematica, Università di Torino, 1997. ⟨hal-00163561⟩

Book sections17 documents

  • Leo Liberti, Gabriele Iommazzo, Carlile Lavor, Nelson Maculan. A Cycle-Based Formulation for the Distance Geometry Problem. Graphs and Combinatorial Optimization: from Theory to Applications, pp.93-106, 2021, ⟨10.1007/978-3-030-63072-0_8⟩. ⟨hal-03250704⟩
  • Gabriele Iommazzo, Claudia d'Ambrosio, Antonio Frangioni, Leo Liberti. Learning to Configure Mathematical Programming Solvers by Mathematical Programming. Learning 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⟩. ⟨hal-03030294⟩
  • Martina Cerulli, Claudia d'Ambrosio, Leo Liberti. Flying safely by bilevel programming. Advances in Optimization and Decision Science for Society, Services and Enterprises, 2020, ⟨10.1007/978-3-030-34960-8_18⟩. ⟨hal-02869682⟩
  • Sammy Khalife, Leo Liberti, Michalis Vazirgiannis. Geometry and Analogies: A Study and Propagation Method for Word Representations. Statistical Language and Speech Processing, pp.100-111, 2019, ⟨10.1007/978-3-030-31372-2_9⟩. ⟨hal-02350281⟩
  • Pierre-Olivier Bauguion, Claudia D’ambrosio, Leo Liberti. Maximum Concurrent Flow with Incomplete Data. Combinatorial 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⟩. ⟨hal-02105082⟩
  • Leo Liberti, Carlile Lavor. Open research areas in distance geometry. Open 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⟩. ⟨hal-02105079⟩
  • Esteban Salgado, Andrea Scozzari, Fabio Tardella, Leo Liberti. Alternating Current Optimal Power Flow with Generator Selection. Combinatorial optimization 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers, pp.364-375, 2018, 978-3-319-96151-4. ⟨hal-02105081⟩
  • Esteban Salgado, Claudio Gentile, Leo Liberti. Perspective Cuts for the ACOPF with Generators. New Trends in Emerging Complex Real Life Problems ODS, Taormina, Italy, September 10–13, 2018, pp.451-461, 2018, 9783030004729. ⟨hal-02105077⟩
  • Claudia D’ambrosio, Leo Liberti. Distance Geometry in Linearizable Norms. Geometric 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⟩. ⟨hal-02105291⟩
  • Leo Liberti. Mathematical Programming Bounds for Kissing Numbers. Optimization and Decision Science: Methodologies and Applications (AIRO/ODS17), pp.213-222, 2017. ⟨hal-02105289⟩
  • Olivier Wang, Leo Liberti. Controlling Some Statistical Properties of Business Rules Programs. Learning and Intelligent Optimization, pp.263-276, 2017. ⟨hal-02105297⟩
  • Antonio Mucherino, Leo Liberti. A VNS-based Heuristic for Feature Selection in Data Mining. Talbi, E-G. Hybrid Metaheuristics, Springer, pp.353-368, 2013. ⟨hal-00912692⟩
  • Leo Liberti, Carlile Lavor, Antonio Mucherino. The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins. Mucherino, Antonio and Lavor, Carlile and Liberti, Leo and Maculan, Nelson. Distance Geometry: Theory, Methods and Applications, Springer, pp.47-60, 2013. ⟨hal-00912689⟩
  • Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti, Andrew J. Miller. On the composition of convex envelopes for quadrilinear terms. Optimization, 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⟩. ⟨hal-00769671⟩
  • Nathanael Beeker, Stéphane Gaubert, Christian Glusa, Leo Liberti. 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⟩. ⟨hal-00782869⟩
  • Lucas Létocart, Sonia Cafieri, Pierre Hansen, Leo Liberti, Frédéric Messine. Compact Relaxations for Polynomial Programming Problems. Experimental Algorithms, 7276, Springer Berlin Heidelberg, pp.75-86, 2012, Lecture Notes in Computer Science, ⟨10.1007/978-3-642-30850-5_8⟩. ⟨hal-03554416⟩
  • Leo Liberti, Sonia Cafieri, Fabien Tarissan. Reformulations in Mathematical Programming: A Computational Approach. Foundations of Computational Intelligence, Vol. 3, 203, Springer, pp.153-234, 2009, Studies in Computational Intelligence, ⟨10.1007/978-3-642-01085-9_7⟩. ⟨hal-01217899⟩

Directions of work or proceedings1 document

  • Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti. Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Paris, France. 2009. ⟨hal-01217897⟩

Other publications1 document

  • Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti. On feasibility based bounds tightening. 2012. ⟨hal-00935464⟩

Preprints, Working Papers, ...6 documents

  • Antoine Oustry, Claudia d'Ambrosio, Leo Liberti, Manuel Ruiz. Certified and accurate SDP bounds for the ACOPF problem. 2022. ⟨hal-03613385⟩
  • Liding Xu, Claudia d'Ambrosio, Sonia Haddad-Vanier, Leo Liberti. On Cutting Planes for Signomial Programming. 2022. ⟨hal-03646663⟩
  • Martina Cerulli, Antoine Oustry, Claudia d'Ambrosio, Leo Liberti. Convergent algorithms for a class of convex semi-infinite programs. 2022. ⟨hal-03339887v2⟩
  • Daniel Bienstock, Martina Cerulli, Mauro Escobar, Leo Liberti. Power network design with line activity. 2021. ⟨hal-03263306⟩
  • Sammy Khalife, Douglas S Gonçalves, Youssef Allouah, Leo Liberti. Further results on latent discourse models and word embeddings. 2020. ⟨hal-02983109⟩
  • Sammy Khalife, Douglas S Gonçalves, Leo Liberti. Distance geometry for word embeddings. 2020. ⟨hal-02892020⟩

Reports2 documents

  • Antoine Oustry, Marion Le Tilly, Thomas Clausen, Claudia d'Ambrosio, Leo Liberti. Optimal deployment of indoor wireless local area networks. [Technical Report] LIX -- Ecole polytechnique. 2021. ⟨hal-03306451⟩
  • Maria Cristina de Cola, Antonio Mucherino, Giovanni Felice, Leo Liberti. A Branch-and-Prune Algorithm for the Sensor Network Localization Problem. [Research Report] 2013. ⟨hal-00912710⟩

Habilitation à diriger des recherches1 document

  • Leo Liberti. Reformulation techniques in Mathematical Programming. Other [cs.OH]. Université Paris Dauphine, 2007. ⟨hal-00163563⟩