The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Leo Liberti" ( http://dblp.L3S.de/Authors/Leo_Liberti )

  Author page on DBLP  Author page in RDF  Community of Leo Liberti in ASPL-2

Publication years (Num. hits)
1999-2007 (17) 2008-2009 (22) 2010 (15) 2011 (16) 2012 (8)
Publication types (Num. hits)
article(33) incollection(5) inproceedings(38) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 24 occurrences of 19 keywords

Results
Found 78 publication records. Showing 78 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko Discretization orders for distance geometry problems. Search on Bibsonomy Optimization Letters The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti Bidirectional A* search on time-dependent road networks. Search on Bibsonomy Networks The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hanif D. Sherali, Evrim Dalkiran, Leo Liberti Reduced RLT representations for nonconvex polynomial programming problems. Search on Bibsonomy J. Global Optimization The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Carlile Lavor, Leo Liberti, Nelson Maculan, Antonio Mucherino Recent advances on the Discretizable Molecular Distance Geometry Problem. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Thierry Marchant, Silvano Martello No end of the world in 2012 for 4OR. Search on Bibsonomy 4OR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Aloise, Pierre Hansen, Leo Liberti An improved column generation algorithm for minimum sum-of-squares clustering. Search on Bibsonomy Math. Program. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Leo Liberti Reformulations in mathematical programming: automatic symmetry detection and exploitation. Search on Bibsonomy Math. Program. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hassan Hijazi, Amadou Diallo, Michel Kieffer, Leo Liberti, Claudio Weidmann A MILP Approach for Designing Robust Variable-Length Codes Based on Exact Free Distance Computation. Search on Bibsonomy DCC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan On the computation of protein backbones by using artificial backbones of hydrogens. Search on Bibsonomy J. Global Optimization The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Laurent Alfandari, Marie-Christine Plateau Edge cover by connected bipartite subgraphs. Search on Bibsonomy Annals OR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Carlile Lavor, Benoît Masson, Antonio Mucherino Polynomial cases of the Discretizable Molecular Distance Geometry Problem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Sonia Cafieri, Ulrich Faigle, Leo Liberti 8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009). Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini Improved strategies for branching on general disjunctions. Search on Bibsonomy Math. Program. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Giacomo Nannicini, Gérard Cornuéjols, Miroslav Karamanov, Leo Liberti Branching on Split Disjunctions. Search on Bibsonomy Combinatorial Optimization - Methods and Applications The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fabio Roda, Leo Liberti, Franco Raimondi Evaluation of Collaborative Filtering Algorithms Using a Small Dataset. Search on Bibsonomy WEBIST The full citation details ... 2011 DBLP  BibTeX  RDF
1Fabio Roda, Alberto Costa, Leo Liberti Optimal recommender systems blending. Search on Bibsonomy WIMS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dominik Kirchler, Leo Liberti, Thomas Pajor, Roberto Wolfler Calvo UniALT for regular language contrained shortest paths on a multi-modal transportation network. Search on Bibsonomy ATMOS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nora Touati Moungla, Pietro Belotti, Vincent Jost, Leo Liberti A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Antonio Mucherino, Carlile Lavor, Therese E. Malliavin, Leo Liberti, Michael Nilges, Nelson Maculan Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems. Search on Bibsonomy SEA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Antonio Mucherino, Carlile Lavor, Leo Liberti A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry Problem. Search on Bibsonomy BIBM Workshops The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem. Search on Bibsonomy COCOA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alberto Costa, Pierre Hansen, Leo Liberti Bound constraints for Point Packing in a Square. Search on Bibsonomy CTW The full citation details ... 2011 DBLP  BibTeX  RDF
1Fabio Roda, Pierre Hansen, Leo Liberti The price of equity in the Hazmat. Search on Bibsonomy CTW The full citation details ... 2011 DBLP  BibTeX  RDF
1Leo Liberti, Benoît Masson, Carlile Lavor, Antonio Mucherino Branch-and-Prune trees with bounded width. Search on Bibsonomy CTW The full citation details ... 2011 DBLP  BibTeX  RDF
1Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi On interval-subgradient and no-good cuts. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alberto Costa, Leo Liberti, Pierre Hansen Formulation symmetries in circle packing. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Stéphane Le Roux, Jeremy Leconte, Fabrizio Marinelli Mathematical programming based debugging. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sonia Cafieri, Jon Lee, Leo Liberti On convex relaxations of quadrilinear terms. Search on Bibsonomy J. Global Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Eric Goubault, Stéphane Le Roux, Jeremy Leconte, Leo Liberti, Fabrizio Marinelli Static Analysis by Abstract Interpretation: A Mathematical Programming Approach. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino On the number of solutions of the discretizable molecular distance geometry problem Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Leo Liberti, Giacomo Nannicini, Nenad Mladenovic A Good Recipe for Solving MINLPs. Search on Bibsonomy Matheuristics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. Search on Bibsonomy SEA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Sonia Cafieri, David Savourey The Reformulation-Optimization Software Engine. Search on Bibsonomy ICMS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Antonio Mucherino, Leo Liberti, Carlile Lavor MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems. Search on Bibsonomy ICMS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti Feasibility-Based Bounds Tightening via Fixed Points. Search on Bibsonomy COCOA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alberto Costa, Pierre Hansen, Leo Liberti Static Symmetry Breaking in Circle Packing. Search on Bibsonomy CTW The full citation details ... 2010 DBLP  BibTeX  RDF
1Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti On the Convergence of Feasibility based Bounds Tightening. Search on Bibsonomy CTW The full citation details ... 2010 DBLP  BibTeX  RDF
1Antonio Mucherino, Carlile Lavor, Leo Liberti, E.-G. Talbi A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem. Search on Bibsonomy AICCSA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda Optimal Technological Architecture Evolutions of Information Systems. Search on Bibsonomy CSDM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Nelson Maculan, Yue Zhang Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem. Search on Bibsonomy Optimization Letters The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Gamma Knife, Sphere covering, Mathematical programming, Reformulation
1Leo Liberti, Carlile Lavor, Nelson Maculan, Fabrizio Marinelli Double variable neighbourhood search with smoothing for the molecular distance geometry problem. Search on Bibsonomy J. Global Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Global continuation, Variable neighbourhood search, Global optimization, Smoothing, Distance geometry, Molecular conformation
1Leo Liberti Reformulations in Mathematical Programming: Definitions and Systematics. Search on Bibsonomy RAIRO - Operations Research The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Nelson Maculan Reformulation techniques in mathematical programming. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Carlile Lavor, Nelson Maculan, Marco Antonio Chaer Nascimento Reformulation in mathematical programming: An application to quantum chemistry. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hanif D. Sherali, Leo Liberti Reformulation-Linearization Technique for Global Optimization. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Tight relaxations, Model reformulation, Mixed-integer 0-1 program, Factorable programs, Reduced relaxations, Convex hull, Valid inequalities, Nonconvex programs, Lift-and-project, Reformulation-linearization technique, Polynomial programs, Convex envelopes
1Carlile Lavor, Leo Liberti, Nelson Maculan Molecular Distance Geometry Problem. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Sonia Cafieri, Fabien Tarissan Reformulations in Mathematical Programming: A Computational Approach. Search on Bibsonomy Foundations of Computational Intelligence The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Antonio Mucherino, Leo Liberti, Carlile Lavor, Nelson Maculan Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF branch and prune, monkey search, protein molecules, combinatorial optimization, distance geometry
1Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan Computing artificial backbones of hydrogen atoms in order to discover protein backbones. Search on Bibsonomy IMCSIT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Carlile Lavor, Leo Liberti, Antonio Mucherino, Nelson Maculan On a discretizable subclass of instances of the molecular distance geometry problem. Search on Bibsonomy SAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF protein backbone, protein molecules, undirected weighted graph, distance geometry, combinatorialization
1Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey The Anonymous Subgraph Problem. Search on Bibsonomy CTW The full citation details ... 2009 DBLP  BibTeX  RDF
1Fabio Roda, Leo Liberti, Franco Raimondi Combinatorial Optimization Based Recommender Systems. Search on Bibsonomy CTW The full citation details ... 2009 DBLP  BibTeX  RDF
1Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini Improved Strategies for Branching on General Disjunctions. Search on Bibsonomy CTW The full citation details ... 2009 DBLP  BibTeX  RDF
1Sonia 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 Search on Bibsonomy CTW The full citation details ... 2009 DBLP  BibTeX  RDF
1Leo Liberti, Franco Raimondi The Secret Santa Problem. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes Bidirectional A* Search for Time-Dependent Fast Paths. Search on Bibsonomy WEA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Leo Liberti Automatic Generation of Symmetry-Breaking Constraints. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Leo Liberti Reformulations in Mathematical Programming: Definitions. Search on Bibsonomy CTW The full citation details ... 2008 DBLP  BibTeX  RDF
1Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes Bidirectional A* on Time-dependent Graphs. Search on Bibsonomy CTW The full citation details ... 2008 DBLP  BibTeX  RDF
1Kanika Dhyani, Leo Liberti Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem. Search on Bibsonomy MCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF k-line center problem, linearization, reformulation, MINLP
1Leo Liberti Compact linearization for binary quadratic problems. Search on Bibsonomy 4OR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF MSC classification 90C20, 90C27, 90C11
1Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti Fast paths in large-scale dynamic road networks Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Sergei Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan New formulations for the Kissing Number Problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti Fast point-to-point shortest path queries on dynamic road networks with interfal data. Search on Bibsonomy CTW The full citation details ... 2007 DBLP  BibTeX  RDF
1Leo Liberti A useful characterization of the feasible region of binary linear programs. Search on Bibsonomy CTW The full citation details ... 2007 DBLP  BibTeX  RDF
1Marie-Christine Plateau, Leo Liberti, Laurent Alfandari Edge cover by bipartite subgraphs. Search on Bibsonomy CTW The full citation details ... 2007 DBLP  BibTeX  RDF
1Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl Graphs and combinatorial optimization. Search on Bibsonomy Discrete Optimization The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Nelson Maculan, Sergei Kucherenko The Kissing Number Problem: A New Result from Global Optimization. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan Algorithms for finding minimum fundamental cycle bases in graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Francesco Maffioli Preface. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Leo Liberti Reformulation and convex relaxation techniques for global optimization. Search on Bibsonomy 4OR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF bilinear problem, Global optimization, reformulation
1Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. Search on Bibsonomy WEA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Leo Liberti, Nelson Maculan, Sergei Kucherenko The Kissing Number Problem: A New Result from Global Optimization. Search on Bibsonomy CTW The full citation details ... 2004 DBLP  BibTeX  RDF
1Leo Liberti, Francesco Maffioli (eds.) CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004 Search on Bibsonomy CTW The full citation details ... 2004 DBLP  BibTeX  RDF
1Edoardo Amaldi, Leo Liberti, Francesco Maffioli Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. Search on Bibsonomy CTW The full citation details ... 2004 DBLP  BibTeX  RDF
1Leo Liberti Performance Comparison of Function Evaluation Methods Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Leo Liberti Structure of the Invertible CA Transformations Group. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #78 of 78 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.