Leo Liberti

Leo Liberti, Thierry Marchant, Silvano Martello: Preface. Annals OR 204(1): 1 (2013)

Leo Liberti, Thierry Marchant, Silvano Martello: Eleven surveys in operations research: III. Annals OR 204(1): 3-9 (2013)

Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey: The Anonymous Subgraph Problem. Computers & OR 40(4): 973-979 (2013)

Alberto Costa, Pierre Hansen, Leo Liberti: On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. Discrete Applied Mathematics 161(1-2): 96-106 (2013)

Silas Sallaume, Simone de Lima Martins, Luiz Satoru Ochi, Warley Gramacho Da Silva, Carlile Lavor, Leo Liberti: A discrete search algorithm for finding the structure of protein backbones and side chains. IJBRA 9(3): 261-270 (2013)

Leo Liberti, Thierry Marchant, Silvano Martello: No end of the world in 2012 for 4OR. 4OR 10(1): 1-13 (2012)

Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda: Technological architecture evolutions of information systems: Trade-off and optimization. Concurrent Engineering: R&A 20(2): 127-147 (2012)

Carlile Lavor, Leo Liberti, Nelson Maculan, Antonio Mucherino: The discretizable molecular distance geometry problem. Comp. Opt. and Appl. 52(1): 115-146 (2012)

Carlile Lavor, Leo Liberti, Nelson Maculan, Antonio Mucherino: Recent advances on the Discretizable Molecular Distance Geometry Problem. European Journal of Operational Research 219(3): 698-706 (2012)

Antonio Mucherino, Carlile Lavor, Leo Liberti: Exploiting Symmetry Properties of the Discretizable molecular Distance Geometry Problem. J. Bioinformatics and Computational Biology 10(3) (2012)

Hanif D. Sherali, Evrim Dalkiran, Leo Liberti: Reduced RLT representations for nonconvex polynomial programming problems. J. Global Optimization 52(3): 447-469 (2012)

Jon Lee, Leo Liberti: A matroid view of key theorems for edge-swapping algorithms. Math. Meth. of OR 76(2): 125-127 (2012)

Daniel Aloise, Pierre Hansen, Leo Liberti: An improved column generation algorithm for minimum sum-of-squares clustering. Math. Program. 131(1-2): 195-220 (2012)

Leo Liberti: Reformulations in mathematical programming: automatic symmetry detection and exploitation. Math. Program. 131(1-2): 273-304 (2012)

Pierre Bonami, Leo Liberti, Andrew J. Miller, Annick Sartenaer: Preface. Math. Program. 136(2): 229-231 (2012)

Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi: A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136(2): 375-402 (2012)

Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti: Bidirectional A* search on time-dependent road networks. Networks 59(2): 240-251 (2012)

Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko: Discretization orders for distance geometry problems. Optimization Letters 6(4): 783-796 (2012)

Antonio Mucherino, Carlile Lavor, Leo Liberti: The discretizable distance geometry problem. Optimization Letters 6(8): 1671-1686 (2012)

Hassan Hijazi, Leo Liberti: Invex Formulations of Unbounded Disjunctions. CTW 2012: 143-146

Leo Liberti: Modelling Rank Constraints in Mathematical Programming. CTW 2012: 181-184

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: 257-266

Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, Manuel Ruiz: Modularity maximization in networks by variable neighborhood search. Graph Partitioning and Graph Clustering 2012: 113-128

Matteo Fischetti, Leo Liberti: Orbital Shrinking. ISCO 2012: 48-58

Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine: Compact Relaxations for Polynomial Programming Problems. SEA 2012: 75-86

Alberto Costa, Leo Liberti: Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal. SEA 2012: 87-98

Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo: A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network. SEA 2012: 236-247

Daniel Delling, Leo Liberti (Eds.): 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2012, September 13, 2012, Ljubljana, Slovenia. OASICS 25, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2012, isbn 978-3-939897-45-3

Leo Liberti, Laurent Alfandari, Marie-Christine Plateau: Edge cover by connected bipartite subgraphs. Annals OR 188(1): 307-329 (2011)

Sonia Cafieri, Ulrich Faigle, Leo Liberti: 8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009). Discrete Applied Mathematics 159(16): 1659 (2011)

Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan: On the computation of protein backbones by using artificial backbones of hydrogens. J. Global Optimization 50(2): 329-344 (2011)

Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini: Improved strategies for branching on general disjunctions. Math. Program. 130(2): 225-247 (2011)

Leo Liberti, Nenad Mladenovic, Giacomo Nannicini: A recipe for finding good solutions to MINLPs. Math. Program. Comput. 3(4): 349-390 (2011)

Dominik Kirchler, Leo Liberti, Thomas Pajor, Roberto Wolfler Calvo: UniALT for regular language contrained shortest paths on a multi-modal transportation network. ATMOS 2011: 64-75

Antonio Mucherino, Carlile Lavor, Leo Liberti: A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry Problem. BIBM Workshops 2011: 390-395

Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino: On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem. COCOA 2011: 322-342

Alberto Costa, Pierre Hansen, Leo Liberti: Bound constraints for Point Packing in a Square. CTW 2011: 126-129

Leo Liberti, Benoît Masson, Carlile Lavor, Antonio Mucherino: Branch-and-Prune trees with bounded width. CTW 2011: 189-193

Fabio Roda, Pierre Hansen, Leo Liberti: The price of equity in the Hazmat. CTW 2011: 235-238

Nora Touati Moungla, Pietro Belotti, Vincent Jost, Leo Liberti: A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem. INOC 2011: 439-449

Antonio Mucherino, Carlile Lavor, Therese E. Malliavin, Leo Liberti, Michael Nilges, Nelson Maculan: Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems. SEA 2011: 206-217

Fabio Roda, Leo Liberti, Franco Raimondi: Evaluation of Collaborative Filtering Algorithms Using a Small Dataset. WEBIST 2011: 603-606

Fabio Roda, Alberto Costa, Leo Liberti: Optimal recommender systems blending. WIMS 2011: 60

Giacomo Nannicini, Gérard Cornuéjols, Miroslav Karamanov, Leo Liberti: Branching on Split Disjunctions. Combinatorial Optimization - Methods and Applications 2011: 164-182

Leo Liberti, Carlile Lavor, Benoît Masson, Antonio Mucherino: Polynomial cases of the Discretizable Molecular Distance Geometry Problem. CoRR abs/1103.1264 (2011)

Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. Comp. Opt. and Appl. 45(1): 143-158 (2010)

Alberto Costa, Leo Liberti, Pierre Hansen: Formulation symmetries in circle packing. Electronic Notes in Discrete Mathematics 36: 1303-1310 (2010)

Leo Liberti, Stéphane Le Roux, Jeremy Leconte, Fabrizio Marinelli: Mathematical programming based debugging. Electronic Notes in Discrete Mathematics 36: 1311-1318 (2010)

Eric Goubault, Stéphane Le Roux, Jeremy Leconte, Leo Liberti, Fabrizio Marinelli: Static Analysis by Abstract Interpretation: A Mathematical Programming Approach. Electr. Notes Theor. Comput. Sci. 267(1): 73-87 (2010)

Sonia Cafieri, Jon Lee, Leo Liberti: On convex relaxations of quadrilinear terms. J. Global Optimization 47(4): 661-685 (2010)

Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi: On interval-subgradient and no-good cuts. Oper. Res. Lett. 38(5): 341-345 (2010)

Antonio Mucherino, Carlile Lavor, Leo Liberti, E.-G. Talbi: A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem. AICCSA 2010: 1-6

Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti: Feasibility-Based Bounds Tightening via Fixed Points. COCOA (1) 2010: 65-76

Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti: On the Convergence of Feasibility based Bounds Tightening. CTW 2010: 21-24

Alberto Costa, Pierre Hansen, Leo Liberti: Static Symmetry Breaking in Circle Packing. CTW 2010: 47-50

Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda: Optimal Technological Architecture Evolutions of Information Systems. CSDM 2010: 137-148

Antonio Mucherino, Leo Liberti, Carlile Lavor: MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems. ICMS 2010: 186-197

Leo Liberti, Sonia Cafieri, David Savourey: The Reformulation-Optimization Software Engine. ICMS 2010: 303-314

Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi: Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. SEA 2010: 350-360

Leo Liberti, Giacomo Nannicini, Nenad Mladenovic: A Good Recipe for Solving MINLPs. Matheuristics 2010: 231-244

Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino: On the number of solutions of the discretizable molecular distance geometry problem. CoRR abs/1010.1834 (2010)

Leo Liberti, Nelson Maculan: Reformulation techniques in mathematical programming. Discrete Applied Mathematics 157(6): 1165-1166 (2009)

Leo Liberti, Carlile Lavor, Nelson Maculan, Marco Antonio Chaer Nascimento: Reformulation in mathematical programming: An application to quantum chemistry. Discrete Applied Mathematics 157(6): 1309-1318 (2009)

Leo Liberti, Carlile Lavor, Nelson Maculan, Fabrizio Marinelli: Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J. Global Optimization 43(2-3): 207-218 (2009)

Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan: Edge-swapping algorithms for the minimum fundamental cycle basis problem. Math. Meth. of OR 69(2): 205-233 (2009)

Leo Liberti, Nelson Maculan, Yue Zhang: Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem. Optimization Letters 3(1): 109-121 (2009)

Leo Liberti: Reformulations in Mathematical Programming: Definitions and Systematics. RAIRO - Operations Research 43(1): 55-85 (2009)

Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini: Improved Strategies for Branching on General Disjunctions. CTW 2009: 144-145

Fabio Roda, Leo Liberti, Franco Raimondi: Combinatorial Optimization Based Recommender Systems. CTW 2009: 175-179

Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey: The Anonymous Subgraph Problem. CTW 2009: 269-274

Antonio Mucherino, Leo Liberti, Carlile Lavor, Nelson Maculan: Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. GECCO 2009: 333-340

Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan: Computing artificial backbones of hydrogen atoms in order to discover protein backbones. IMCSIT 2009: 759-764

Carlile Lavor, Leo Liberti, Antonio Mucherino, Nelson Maculan: On a discretizable subclass of instances of the molecular distance geometry problem. SAC 2009: 804-805

Leo Liberti, Sonia Cafieri, Fabien Tarissan: Reformulations in Mathematical Programming: A Computational Approach. Foundations of Computational Intelligence (3) 2009: 153-234

Carlile Lavor, Leo Liberti, Nelson Maculan: Molecular Distance Geometry Problem. Encyclopedia of Optimization 2009: 2304-2311

Hanif D. Sherali, Leo Liberti: Reformulation-Linearization Technique for Global Optimization. Encyclopedia of Optimization 2009: 3263-3268

Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti (Eds.): Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009. 2009

Leo Liberti, Franco Raimondi: The Secret Santa Problem. AAIM 2008: 271-279

Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti: Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA 2008: 225-234

Leo Liberti: Automatic Generation of Symmetry-Breaking Constraints. COCOA 2008: 328-338

Leo Liberti: Reformulations in Mathematical Programming: Definitions. CTW 2008: 66-70

Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A^* on Time-dependent Graphs. CTW 2008: 132-135

Kanika Dhyani, Leo Liberti: Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem. MCO 2008: 87-96

Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A^* Search for Time-Dependent Fast Paths. WEA 2008: 334-346

Leo Liberti: Compact linearization for binary quadratic problems. 4OR 5(3): 231-245 (2007)

Sergei Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan: New formulations for the Kissing Number Problem. Discrete Applied Mathematics 155(14): 1837-1841 (2007)

Leo Liberti: A useful characterization of the feasible region of binary linear programs. CTW 2007: 103-106

Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti: Fast point-to-point shortest path queries on dynamic road networks with interfal data. CTW 2007: 115-118

Marie-Christine Plateau, Leo Liberti, Laurent Alfandari: Edge cover by bipartite subgraphs. CTW 2007: 127-132

Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. CoRR abs/0704.1068 (2007)

Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl: Graphs and combinatorial optimization. Discrete Optimization 3(3): 179 (2006)

Leo Liberti: Reformulation and convex relaxation techniques for global optimization. 4OR 2(3): 255-258 (2004)

Leo Liberti, Francesco Maffioli: Preface. Electronic Notes in Discrete Mathematics 17: 1 (2004)

Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan: Algorithms for finding minimum fundamental cycle bases in graphs. Electronic Notes in Discrete Mathematics 17: 29-33 (2004)

Leo Liberti, Nelson Maculan, Sergei Kucherenko: The Kissing Number Problem: A New Result from Global Optimization. Electronic Notes in Discrete Mathematics 17: 203-207 (2004)

Edoardo Amaldi, Leo Liberti, Francesco Maffioli: Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. CTW 2004: 33-36

Leo Liberti, Nelson Maculan, Sergei Kucherenko: The Kissing Number Problem: A New Result from Global Optimization. CTW 2004: 180-183

Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli: Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. WEA 2004: 14-29

Leo Liberti, Francesco Maffioli (Eds.): CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004. 2004

Leo Liberti: Performance Comparison of Function Evaluation Methods. CoRR cs.SC/0206010 (2002)

Leo Liberti: Structure of the Invertible CA Transformations Group. J. Comput. Syst. Sci. 59(3): 521-536 (1999)