The SCEAS System
Navigation Menu

Search the dblp DataBase


Leo Liberti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli
    Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:14-29 [Conf]
  2. Leo Liberti
    Reformulation and convex relaxation techniques for global optimization. [Citation Graph (0, 0)][DBLP]
    4OR, 2004, v:2, n:3, pp:255-258 [Journal]
  3. Leo Liberti
    Performance Comparison of Function Evaluation Methods [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  4. Leo Liberti
    Structure of the Invertible CA Transformations Group. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:3, pp:521-536 [Journal]
  5. Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti
    Fast paths in large-scale dynamic road networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  6. Sergei Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan
    New formulations for the Kissing Number Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:14, pp:1837-1841 [Journal]

  7. The Secret Santa Problem. [Citation Graph (, )][DBLP]

  8. Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. [Citation Graph (, )][DBLP]

  9. MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems. [Citation Graph (, )][DBLP]

  10. The Reformulation-Optimization Software Engine. [Citation Graph (, )][DBLP]

  11. On a discretizable subclass of instances of the molecular distance geometry problem. [Citation Graph (, )][DBLP]

  12. Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. [Citation Graph (, )][DBLP]

  13. Bidirectional A* Search for Time-Dependent Fast Paths. [Citation Graph (, )][DBLP]

  14. Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. [Citation Graph (, )][DBLP]

  15. Automatic Generation of Symmetry-Breaking Constraints. [Citation Graph (, )][DBLP]

  16. Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem. [Citation Graph (, )][DBLP]

  17. Combinatorial Optimization Based Recommender Systems. [Citation Graph (, )][DBLP]

  18. Edge cover by bipartite subgraphs. [Citation Graph (, )][DBLP]

  19. A useful characterization of the feasible region of binary linear programs. [Citation Graph (, )][DBLP]

  20. Fast point-to-point shortest path queries on dynamic road networks with interfal data. [Citation Graph (, )][DBLP]

  21. Reformulations in Mathematical Programming: Definitions. [Citation Graph (, )][DBLP]

  22. Bidirectional A* on Time-dependent Graphs. [Citation Graph (, )][DBLP]

  23. The Anonymous Subgraph Problem. [Citation Graph (, )][DBLP]

  24. Improved Strategies for Branching on General Disjunctions. [Citation Graph (, )][DBLP]

  25. Computing artificial backbones of hydrogen atoms in order to discover protein backbones. [Citation Graph (, )][DBLP]

  26. Compact linearization for binary quadratic problems. [Citation Graph (, )][DBLP]

  27. Reformulation in mathematical programming: An application to quantum chemistry. [Citation Graph (, )][DBLP]

  28. Reformulation techniques in mathematical programming. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002