Marco Locatelli

Dipartimento di Ingegneria Informatica
Universita' di Parma
Viale G.P.Usberti 181/A
43100 Parma (Italy)
tel. +39  0521 905711
fax  +39   0521    905798




Marco Locatelli

Born in Piacenza, 10/01/1968

Got the Degree in Information Science at the Universita' Statale di Milano
(July 16, 1992) presenting a thesis with the title "Algoritmi Bayesiani per
l'Ottimizzazione Globale" and getting the final mark 110/110 cum laude.

In the period November 1992-November 1996 attended the Ph.D. courses in
Matematica Computazionale e Ricerca Operativa at the Universita' Statale di
Milano and got the Ph.D. degree by presenting a thesis with the title
"Algoritmi di Ottimizzazione Globale"

In the period April 1997-March 1998 and in July 1998 obtained a fellowship
by the University of Trier (Germany) working with the research group of
Prof. Dr. R.Horst

In the period September 1998-October 1999 obtained a Post-Doc fellowship by
the Dipartimento di Sistemi e Informatica, Universita' di Firenze

From November 1999 until March 2002 he has worked as researcher by the Dipartimento di Informatica,
Universita' di Torino

Since March 2002 he is associate professor  by the Dipartimento di Informatica,
Universita' di Torino

Since October 2009 until October 2010 he is associate professor  by the Dipartimento di Ingegneria dell'Informazione,
Universita' di Parma

Since November 2010 he is full professor  by the Dipartimento di Ingegneria dell'Informazione,
Universita' di Parma

He is member of the editorial board of Computational Optimization and Applications and of Journal of Global Optimization


His research interests are related to problems in Continuous Global Optimization.
In this field he has explored from the theoretical and/or experimental point of view
the following issues:

Multistart like algorithms
Simulated annealing algorithms for continuous global optimization
One-dimensional global optimization
Concave optimization over polytopes
Convex envelopes
Domain reductions
Standard quadratic problems
Complexity of global optimization problems
Packing problems
Molecular conformation problems
Space trajectory planning problems

See also the Global Optimization Laboratory




INTERNATIONAL JOURNALS (published or accepted for publication)

(a) Papers published or accepted for publication in international journals

1. M.Locatelli, F.Schoen, "An adaptive stochastic global optimization
algorithm for one-dimensional functions", Annals of Operations Research 58,
263-278 (1995)

2. M.Locatelli, "Bayesian Algorithms for one-dimensional global
optimization", Journal of Global Optimization Vol.10, No. 1, 57-76 (1997)

3. M.Locatelli, F.Schoen, "Simple Linkage: analysis of a threshold-accepting
global optimization method", Journal of Global Optimization Vol. 9, No.1,
95-111 (1996)

4. M.Locatelli, "Convergence properties of simulated annealing for
continuous global optimization", Journal of Applied Probability Vol. 33,
1127-1140 (1996)

5. M. Duer, R. Horst, M. Locatelli, "Necessary and sufficient global
optimization conditions for convex maximization revisited", Journal of
Mathematical Analysis and Applications 217, 637-649 (1998)

6. M.Locatelli, "Relaxing the assumptions of the Multi Level Single Linkage
algorithm", Journal of Global Optimization 13, 25-42 (1998)

7. M.Locatelli, "Finiteness of conical algorithms with w-subdivisions",
Mathematical Programming, 85(3), 593-616 (1999)

8. M.Locatelli, F.Schoen, "Random Linkage: a family of acceptance/rejection
algorithms for global optimization", Mathematical Programming, 85(2), 379-396 (1999)

9. M.Locatelli, "Simulated annealing algorithms for continuous global
optimization: convergence conditions",  Journal of Optimization
Theory and Applications, 104, 121-133 (2000)

10. M.Locatelli, U.Raber, "On the convergence of the simplicial
branch-and-bound algorithm based on w-subdivisions", Journal of Optimization
Theory and Applications, 107, 69-79 (2000)

11. M.Locatelli, U.Raber, "A finiteness result for the simplicial branch-and
bound algorithm based on w-subdivisions", Journal of Optimization
Theory and Applications, 107, 81-88 (2000)

12. M.Locatelli, "Convergence of a simulated annealing algorithm for
continuous global optimization", Journal of Global Optimization,
18, 219-233 (2000)

13. M.Locatelli, N.V.Thoai, "Finite exact branch-and-bound algorithms for
concave minimization over polytopes", Journal of Global Optimization,
18, 107-128 (2000)

14. M.Locatelli, F.Schoen, " Fast Global Optimization of Difficult Lennard-Jones
Clusters", Computational Optimization and Applications, 21, 55-70 (2002)

15. M.Locatelli, "Convergence and first hitting time of simulated annealing algorithms
for continuous global optimization", Mathematical Methods of Operations Research,
54(2), 171-199 (2001)

16. M.Locatelli, F.Schoen, "Minimal interatomic distance in Morse clusters",  Journal of Global
Optimization, 22, 175-190 (2002)

17. M.Locatelli, U.Raber, "Packing equal circles into a square:  a
deterministic global optimization approach", Discrete Applied Mathematics, 122, 139-166 (2002)

18. M.Locatelli, "A note on the Griewank test function", Journal of Global Optimization, 25, 169-174 (2003)

19. M.Locatelli, F.Schoen, "Efficient algorithms for large scale global optimization: Lennard-Jones clusters",
Computational Optimization and Applications, 26 (2): 173-190 (2003)

 20. P.Fosser, R.Glantz, M.Locatelli, M.Pelillo, "Swap strategies for graph matching", Lecture Notes in Computer Science,
2726, 142-153 (2003)

21. I.M. Bomze, M. Locatelli, "Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches",
Computational Optimization and Applications, 28, 227-245 (2004)

22. M. Locatelli, G.R. Wood, "Objective Function Features Providing Barriers to Rapid Global Optimization", Journal of Global Optimization,
31, 549-565 (2005)

23. M.Locatelli, I.Bomze, M.Pelillo, "The combinatorics of pivoting for the maximum weight clique", Operations Research Letters, 32,
523-529 (2004)

24. J.P.K. Doye, R. Leary, M.Locatelli, F.Schoen, "The global optimization of Morse clusters by potential transformations",
INFORMS Journal on Computing
, 16(4), 371-379 (2004)

25. M.Locatelli, "On the multilevel structure of global optimization problems", Computational Optimization and Applications, 30, 5-22 (2005)

26. A.Grosso, M.Locatelli, F.Della Croce, "Combining swaps and nodes weighting in an adaptive
greedy approach for the maximum clique problem", Journal of Heuristics, 10, 135-152 (2004)

27. B.Addis, M. Locatelli, F.Schoen, Local optima smoothing for global optimization, Optimization Methods and Software, 20, 417-437 (2005)

28.  A.Grosso, M.Locatelli, F.Schoen ,  A population based approach for hard global optimization problems based
on dissimilarity measures, Mathematical Programming,
110, 373-404 (2007)

29. G.Carello, F.Della Croce, A.Grosso, M.Locatelli, A maximum node clustering problem, Journal of Combinatorial Optimization, 11(4), 373-385 (2006)

30. A.Grosso, M.Locatelli, F.Schoen, An experimental analysis of a population based approach for global optimization, Computational Optimization
and Applications,
38(3), 351-370 (2007)

31. M.Locatelli, F.Schoen, Structure prediction and global optimization, Optima (Mathematical Programming Society Newsletter), 76, 1-8 (2008)

32.  B.Addis, M.Locatelli, A new class of test functions for global optimization,  Journal of Global Optimization, 38(3), 479-501 (2007)

33.  B.Addis, M.Locatelli, F.Schoen, Efficiently packing unequal disks in a circle: a computational approach which exploits
the continuous and combinatorial structure of the problem, Operations Research Letters, 36 (1), 37-42 (2008)

34. A.Grosso, M.Locatelli, W.Pullan, Randomness, plateau search, penalties, restart rules : simple ingredients leading
to very efficient heuristics for the Maximum Clique Problem,
Journal of Heuristics, 14(6), 587-612 (2008)

35. I.M. Bomze, M.Locatelli, F.Tardella, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability,
Mathematical Programming, 115 (1), 31-64 (2008)

36. A.Grosso, M.Locatelli, F.Schoen,  Solving molecular distance geometry problems by global optimization algorithms, to appear
in Computational Optimization and Applications

37. D. Depetrini, M.Locatelli, A FPTAS for a class of Linear Multiplicative problems, to appear
 in Computational Optimization and Applications

38. B.Addis, M.Locatelli, F.Schoen, Disk packing in a square: a new global optimization approach, INFORMS Journal on Computing,
20(4),  516-524 (2008)

39.  M.Locatelli, Complexity results for some global optimization problems,  Journal of Optimization Theory and Applications,
140,  93-102 (2009)

40. M.Vasile, M. Locatelli, A hybrid multiagent approach for global trajectory optimization,
Journal of Global Optimization, 44,  461-479 (2009)

41. A. Cassioli, M.Locatelli, F.Schoen, Dissimilarity Measures for Population-Based Global Optimization Algorithms, Computational Optimization and Applications, 45,  257-281 (2010)

42.  A. Grosso, A. Jamali, M.Locatelli, Finding Maximin Latin Hypercube Designs by Iterated Local Search Heuristics, European Journal of Operations Research, 197,  541-547 (2009)

43 F. Della Croce, A.Grosso, M.Locatelli,  A heuristic approach for the Max-Min Diversity  Problem based on Max Clique, Computers & Operations Research, 36,  2429-2433 (2009)

44 A. Cassioli, M.Locatelli, F.Schoen, Global Optimization of Binary Lennard-Jones Clusters,Optimization
Methods and Software,
24,  819-835 (2009)

45. A.Caprara, M.Locatelli, Global optimization problems and domain reduction strategies, Mathematical Programming, 125,  123-137 (2010)

46. I.M. Bomze, F.Frommlet, M.Locatelli, Copositive bounds for  improving SDP bounds on the clique number, Mathematical Programming, 124,  13-32 (2010)

47.  I.M. Bomze, F.Frommlet, M.Locatelli, Gap, cosum, and product properties of the theta′ bound on the clique number, Optimization, 59,  1041-1051 (2010)
48. B. Addis, A. Cassioli, M. Locatelli, F.Schoen, A global optimization method for the design of space trajectories, Computational Optimization and Applications, 48,  635-652 (2011)

49. D. Depetrini, M.Locatelli, Approximation algorithms for linear fracional/multiplicative problems, Mathematical Programming,
128,  437-443 (2011)

50. A. Grosso, A. Jamali, M.Locatelli, F.Schoen, Solving the problem of packing equal and unequal circles in a circular container, Journal of Global Optimization,
47,  63-81 (2010)

51. M. Vasile, E. Minisci, M.Locatelli, Analysis of some Global Optimization Algorithms for Space Trajectory Design, Journal of Spacecraft and Rockets,
47,  334-344 (2010)

52.  A. Cassioli, D. Di Lorenzo, M.Locatelli, F.Schoen, M.Sciandrone, Machine learning for global optimization, Computational Optimization and Applications, 51,  279-303 (2012)

53.  Vasile, M. Minisci, E. Locatelli, M., An inflationary differential evolution algorithm for space trajectory optimization, IEEE Transactions on Evolutionary Computation, 15,  267-281 (2011)

54.  Cassioli, A. Locatelli, M., A heuristic approach for packing identical rectangles in convex regions, Computers and Operations Research, 38,  1342-1350 (2011)

55.  Di Summa, M. Grosso, A. Locatelli, M., Complexity of the critical node problem over trees, Computers and Operations Research, 38,  1766-1774 (2011)

56.  M.Locatelli, F.Schoen, On the relation between concavity cuts and the surrogate dual for convex maximization problems, Journal of Global Optimization, 52,  411-421 (2012)

57.  Bomze, I.M. Locatelli, M., Separable standard quadratic optimization problems, Optimization Letters, 6,  857-866 (2012)

58.  Di Summa, M. Grosso, A. Locatelli, M., Branch and cut algorithms for detecting critical nodes in undirected graphs, Computational Optimization and Applications, 53,  649-680 (2012)

59.  Locatelli, M. Schoen, F., Local search based heuristics for global optimization: Atomic clusters and beyond, European Journal of Operational Research, 222,  1-9 (2012)

60.  Locatelli, M., Approximation algorithms for a class of global optimization problems, to appear in Journal of Global Optimization,

61.  Locatelli, M. Schoen, F., On convex envelopes for bivariate functions over polytopes, to appear in Mathematical Programming,

home (publications)
home (top page)
(b) Papers published on international edited books

1. M.Locatelli, F.Schoen, "Theoretical and experimental analysis of Random
Linkage algorithms for global optimization", System Modelling and
Optimization, 473-480 (1995)

2. M.Locatelli, "Simulated annealing algorithms for continuous global optimization",
Handbook of Global Optimization II, Kluwer Academic Publishers, 179-230 (2002)

3.  M.Locatelli, F.Schoen,"Global minimization of Lennard-Jones clusters by a two-phase monotonic method ", 
in P.M. Pardalos, V. Korotkikh (Eds.) Optimization and Industry: New Frontiers, 221-240 (2003)

4. A.Grosso, M.Locatelli, F.Schoen , Experimental Analysys of a Population-Based Approach for Difficult
Global Optimization Problems, Proceedings della Fifth International Conference on Computer Sciences, MCO ’04 , Metz  (2004)

5. A. Caprara, M.Locatelli, M.Monaci, Bidimensional Packing by Bilinear Programming, Proceedings IPCO '05, Lecture Notes in Computer Science, 3509, 377-391 (2005)

home (publications)
home (top page)
(c) Others

1. M.Locatelli, "Algoritmi di ottimizzazione globale", Ph.D. thesis (in

2. M.Locatelli, F.Schoen, L.Tonelli, "Il degente virtuale", Management
ospedaliero, 108/109, 171-174, Maggio-Agosto 1998 (in italian)

3. M.Locatelli, "Algoritmi di ottimizzazione globale", summary of the Ph.D.
thesis, Bollettino U.M.I., (8), 1-A Suppl., 189-192 (1998) (in italian)

4. M.Locatelli, book review of "Optimal solution of nonlinear equations" by K. A. Sikorski,
Computer Journal, 45(2) (2002)

home (publications)
home (top page)