CINECA IRIS Institutional Research Information System

LOCATELLI, Marco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1134
EU - Europa 1044
AS - Asia 349
OC - Oceania 3
Continente sconosciuto - Info sul continente non disponibili 2
AF - Africa 1
Totale 2533
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1097
CN - Cina 231
UA - Ucraina 182
IE - Irlanda 155
SE - Svezia 153
DE - Germania 124
FR - Francia 91
FI - Finlandia 90
IT - Italia 88
KR - Corea 85
GB - Regno Unito 65
DK - Danimarca 41
CA - Canada 36
PL - Polonia 30
VN - Vietnam 27
BE - Belgio 14
RU - Federazione Russa 6
AU - Australia 3
ES - Italia 3
IN - India 3
EU - Europa 2
HU - Ungheria 1
JP - Giappone 1
MU - Mauritius 1
MX - Messico 1
MY - Malesia 1
NL - Olanda 1
TR - Turchia 1
Totale 2533
Salva come PNG Salva come JPEG
Città #
Chandler 209
Beijing 200
Dublin 155
Jacksonville 149
Ann Arbor 132
Dearborn 69
Houston 60
Princeton 49
Villeurbanne 49
Medford 41
Wilmington 39
Fairfield 31
Warsaw 30
Boston 29
Milan 26
Ashburn 25
Dong Ket 23
Woodbridge 22
Toronto 20
Torino 18
Verona 17
Nyköping 15
Boardman 14
Brussels 14
Norwalk 12
Lachine 11
Seattle 8
Fremont 7
Redmond 6
Auburn Hills 4
Cambridge 4
Guangzhou 4
Hefei 4
Ottawa 4
Pisa 4
San Mateo 4
Wayne 4
Gladbeck 3
Kunming 3
Los Angeles 3
Moscow 3
Nanjing 3
Chengdu 2
Coimbatore 2
Falls Church 2
Fuzhou 2
Karlsruhe 2
Nanchang 2
Naples 2
New York 2
Padova 2
Parma 2
Rome 2
San Francisco 2
Vimodrone 2
Bari 1
Berzantina 1
Buffalo 1
Cedar Knolls 1
Changsha 1
Chongqing 1
Grigno 1
Hebei 1
Istanbul 1
Kuala Lumpur 1
London 1
Marigliano 1
Mcallen 1
Monmouth Beach 1
Montréal 1
Mountain View 1
Nantong 1
Phoenix 1
Redwood City 1
Reston 1
San Antonio 1
San Diego 1
Shanghai 1
Shenyang 1
Talence 1
Tokyo 1
Turin 1
Udine 1
Wenzhou 1
Wuhan 1
Xian 1
Totale 1584
Salva come PNG Salva come JPEG
Nome #
Partitioned Least Squares 219
Complexity of the critical node problem over trees 121
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 84
Efficiently packing unequal disks in a circle: a computational approach which exploits the continous and combinatorial structure of the problem 77
Adaptive deep brain stimulation controls levodopa-induced side effects in Parkinsonian patients 76
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability 68
Bidimensional Packing by Bilinear Programming 68
A maximum node clustering problem 67
Swap strategies for graph matching 66
A heuristic approach for the max–min diversity problem based on max-clique 65
A new class of test functions for global optimization 64
Solving molecular distance geometry problems by global optimization algorithms 63
Structure prediction and global optimization 63
Experimental Analysys of a Population-Based Approach for Difficult Global Optimization Problems 62
Local optima smoothing for global optimization 59
Convergence of a simulated annealing algorithm for continuous global optimization 59
Packing equal circles into a square: a deterministic global optimization approach 59
An experimental analysis of a population based approach for global optimization 57
Finite exact branch-and-bound algorithms for concave minimization over polytopes 56
Bayesian Algorithms for one-dimensional global optimization 55
Finding maximin latin hypercube designs by Iterated Local Search heuristics 55
Simple Linkage: analysis of a threshold-accepting global optimization method 54
A note on the Griewank test function 53
A population based approach for hard global optimization problems based on dissimilarity measures 52
Minimal interatomic distance of Morse clusters 50
Random Linkage: a family of acceptance/rejection algorithms for global optimization 49
Simulated annealing algorithms for continuous global optimization: convergence conditio 48
On the convergence of the simplicial branch-and-bound algorithm based on w-subdivisions 48
Efficient algorithms for large scale global optimization: Lennard-Jones clusters 46
A finiteness result for the simplicial branch-and-bound algorithm based on w-subdivisions 45
Necessary and sufficient global optimization conditions for convex maximization revisited 45
Convergence properties of simulated annealing for continuous global optimization 44
Convergence and first hitting time of simulated annealing algorithms for continuous global optimization 44
Relaxing the assumptions of the Multi Level Single Linkage algorithm 43
The combinatorics of pivoting for the maximum weight clique 42
review del libro "Optimal solution of nonlinear equations" di K. A. Sikorski, 41
Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches 40
The global optimization of Morse clusters by potential transformations 40
Disk packing in a square: a new global optimization approach 40
Finiteness of conical algorithms with w-subdivisions 37
Complexity results for some global optimization problems 37
An adaptive stochastic global optimization algorithm for one-dimensional functions 36
Simple ingredients leading to very efficient heuristics for the maximum clique problem 35
On the multilevel structure of global optimization problems 31
Objective Function Features Providing Barriers to Rapid Global Optimization 30
Fast global optimization of difficult Lennard-Jones clusters 29
Solving the problem of packing equal and unequal circles in a circular container 27
Totale 2649
Salva come PNG Salva come JPEG
Categoria #
all - tutte 4585
article - articoli 0
book - libri 0
conference - conferenze 469
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 5054
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2017/2018216 0000 00 00 1238733
2018/2019152 13184 145 418 24466
2019/2020516 853935 4584 7526 69405139
2020/2021433 48144624 2919 4010 71444741
2021/2022325 491123 193 3322 91171110
2022/2023522 57272670 48174 6622 32000
Totale 2649