The SCEAS System
Navigation Menu

Search the dblp DataBase


Marco Locatelli: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paolo Fosser, Roland Glantz, Marco Locatelli, Marcello Pelillo
    Swap Strategies for Graph Matching. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2003, pp:142-153 [Conf]
  2. Alberto Caprara, Marco Locatelli, Michele Monaci
    Bidimensional Packing by Bilinear Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:377-391 [Conf]
  3. Marco Locatelli, Ulrich Raber
    Packing equal circles in a square: a deterministic global optimization approach. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:139-166 [Journal]
  4. Andrea Grosso, Marco Locatelli, Federico Della Croce
    Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2004, v:10, n:2, pp:135-152 [Journal]
  5. Jonathan P. K. Doye, Robert H. Leary, Marco Locatelli, Fabio Schoen
    Global Optimization of Morse Clusters by Potential Energy Transformations. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2004, v:16, n:4, pp:371-379 [Journal]
  6. Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli
    A "maximum node clustering" problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:4, pp:373-385 [Journal]
  7. Marco Locatelli, Immanuel M. Bomze, Marcello Pelillo
    The combinatorics of pivoting for the maximum weight clique. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:523-529 [Journal]
  8. Andrea Grosso, Marco Locatelli, Fabio Schoen
    A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:2, pp:373-404 [Journal]

  9. A dynamical system perspective on evolutionary heuristics applied to space trajectory optimization problems. [Citation Graph (, )][DBLP]

  10. A heuristic approach for the max-min diversity problem based on max-clique. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
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