LOCATELLI, Marco
 Distribuzione geografica
Continente #
NA - Nord America 2.528
EU - Europa 1.808
AS - Asia 1.037
OC - Oceania 4
Totale 5.377
Nazione #
US - Stati Uniti d'America 2.478
CN - Cina 875
IE - Irlanda 486
SE - Svezia 390
UA - Ucraina 268
FI - Finlandia 224
DE - Germania 159
IT - Italia 157
TR - Turchia 110
CA - Canada 49
AT - Austria 35
BE - Belgio 24
IN - India 19
SG - Singapore 17
GB - Regno Unito 14
NL - Olanda 10
FR - Francia 8
SK - Slovacchia (Repubblica Slovacca) 8
CZ - Repubblica Ceca 7
RU - Federazione Russa 6
KZ - Kazakistan 5
JP - Giappone 4
CH - Svizzera 3
HK - Hong Kong 3
AU - Australia 2
HU - Ungheria 2
IR - Iran 2
LV - Lettonia 2
NZ - Nuova Zelanda 2
PK - Pakistan 2
BG - Bulgaria 1
DO - Repubblica Dominicana 1
GR - Grecia 1
HR - Croazia 1
PL - Polonia 1
RO - Romania 1
Totale 5.377
Città #
Chandler 544
Dublin 485
Jacksonville 323
Beijing 275
Ann Arbor 214
Ashburn 171
Nanjing 151
Princeton 129
Dearborn 114
Izmir 108
San Mateo 70
Kunming 59
Wilmington 56
Des Moines 47
Nanchang 47
Helsinki 44
Shenyang 44
Hebei 40
Toronto 37
Parma 34
Vienna 34
Shanghai 33
Hefei 30
Brussels 24
Jinan 22
Changsha 20
Jiaxing 19
New York 18
Pune 17
Seattle 17
Tianjin 17
Guangzhou 16
Woodbridge 14
Houston 11
Boardman 9
Haikou 9
Los Angeles 9
Chengdu 8
Rome 8
West Jordan 8
Bologna 7
Colorno 7
Fremont 7
Milan 7
Ningbo 7
Norwalk 7
Serina 7
Borås 6
Bratislava 6
Chongqing 6
Fort Worth 6
Grafing 6
Hangzhou 6
Ottawa 6
Aktobe 5
Cambridge 5
Luzzara 5
Taiyuan 5
Wuhan 5
Fayetteville 4
Lugo 4
Mountain View 4
Porretta Terme 4
Quzhou 4
Rockville 4
Zhengzhou 4
Fuzhou 3
Heerbrugg 3
Reggio Emilia 3
Rouhling 3
Sassuolo 3
Taizhou 3
Turin 3
Xian 3
Belluno 2
Bremen 2
Brescia 2
Brno 2
Castenaso 2
Central 2
Dallas 2
Kocaeli 2
Langfang 2
Marlborough 2
Mestre 2
Modena 2
Nola 2
Redmond 2
Rho 2
San Jose 2
Scandiano 2
Shaoxing 2
Singapore 2
Tappahannock 2
Washington 2
Wenzhou 2
Zanjan 2
Albareto 1
Athens 1
Avezzano 1
Totale 3.552
Nome #
A linear-time algorithm for minimum-time velocity planning of autonomous vehicles 74
Graph-based algorithms for the efficient solution of optimization problems involving monotone functions 68
Solving the Minimum-Time Velocity Planning Problem through an Hypergraph-Based Approach 67
Convergence Analysis of Spatial-Sampling-Based Algorithms for Time-Optimal Smooth Velocity Planning 67
A heuristic approach for packing identical rectangles in convex regions 64
A global optimization method for the design of space trajectories 61
Approximation of linear fracional-multiplicative problems 61
Convex envelopes of some quadratic functions over the n-dimensional unit simplex 60
A Consensus Approach to Dynamic Programming 60
Analysis of some Global Optimization Algorithms for Space Trajectory Design 59
On the multilevel structure of global optimization problems 58
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 58
Simple ingredients leading to very efficient heuristics for the maximum clique problem 57
Convex envelope of bivariate cubic functions over rectangular regions 57
Copositive cuts for improving SDP bounds on the clique number 56
An experimental analysis of a population based approach for global optimization 54
Gap, cosum, and product properties of the theta bound on the clique number 54
The combinatorics of pivoting for the maximum weight clique 54
A dynamical System Prospective on Evolutionary Heuristics Applied toSpace Trajectory Optimization Problems 53
Time-optimal velocity planning by a bound-tightening technique 53
A graph-based algorithm for optimal control of switched systems: An application to car parking 53
Jerk bounded velocity planner for the online management of autonomous vehicles 52
Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints 52
Efficient local search procedures for quadratic fractional programming problems 52
Efficiently packing unequal disks in a circle: a computational approach which exploits the continous and combinatorial structure of the problem 51
Structure prediction and global optimization 51
Finding maximin latin hypercube designs by Iterated Local Search heuristics. 51
Convergence properties of simulated annealing for continuous global optimization 51
A solution of the minimum-time speed planning problem based on lattice theory 51
A FPTAS for a class of linear multiplicative problems 51
A Jacobi-like acceleration for dynamic programming 51
An inflationary Differential Evolution algorithm for space trajectory optimization 50
A computational study on QP problems with general linear constraints 50
Optimal Time-Complexity Speed Planning for Robot Manipulators 49
Iterated local search approaches to maximin latin hypercube designs 49
Simulated annealing algorithms for continuous global optimization: convergence conditio 48
A maximum node clustering problem 47
A hybrid multiagent approach for global trajectory optimization 47
Random Linkage: a family of acceptance/rejection algorithms for global optimization 47
On the convergence of the simplicial branch-and-bound algorithm based on w-subdivisions 47
Global optimization of binary Lennard-Jones clusters 46
Complexity of the critical node problem over trees 46
A new branch-and-bound algorithm for standard quadratic programming problems 46
Local search based heuristics for global optimization: Atomic clusters and beyond 46
Optimizing Cooperative Pallet Loading Robots: A Mixed Integer Approach 46
Complexity results for some global optimization problems 45
Objective Function Features Providing Barriers to Rapid Global Optimization 45
Bayesian Algorithms for one-dimensional global optimization 45
A note on the Griewank test function 45
A branch and bound approach for a class of non-convex problems with applications to robust regression 45
review del libro "Optimal solution of nonlinear equations" di K. A. Sikorski, 44
A population based approach for hard global optimization problems based on dissimilarity measures 44
Bidimensional Packing by Bilinear Programming 44
null 44
Smart changes of the end-effector orientation for the automatic handling of singular configurations 44
Simulated annealing algorithms for continuous global optimization 43
Fast global optimization of difficult Lennard-Jones clusters 43
Disk packing in a square: a new global optimization approach 43
Optimization and homotopy methods for the gibbs free energy of simple magmatic mixtures 43
(Non) convergence results for the differential evolution method 43
An adaptive stochastic global optimization algorithm for one-dimensional functions 43
A Sequential Algorithm for Jerk Limited Speed Planning 43
Packing equal circles into a square: a deterministic global optimization approach 42
Global optimization problems and domain reduction strategies 42
Local optima smoothing for global optimization 42
A finiteness result for the simplicial branch-and-bound algorithm based on w-subdivisions 42
Relaxing the assumptions of the Multi Level Single Linkage algorithm 41
A Mixed Approach for Pallet Building Problem with Practical Constraints 41
Finiteness of conical algorithms with w-subdivisions 40
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability 40
A multigraph-based selective update method for the efficient solution of dynamic programming 40
Theoretical and experimental analysis of Random Linkage algorithms for global optimization 39
Global optimization based on local searches 39
On the complexity of quadratic programming with two quadratic constraints 39
Separable standard quadratic optimization problems 39
Computational investigation of simple memetic approaches for continuous global optimization 39
Convergence and first hitting time of simulated annealing algorithms for continuous global optimization 38
Alternative branching rules for some nonconvex problems 38
A real-time strategy for the management of kinematic singularities: New progresses 38
Solution of a practical pallet building problem with visibility and contiguity constraints 38
Convergence of a simulated annealing algorithm for continuous global optimization 38
Finite exact branch-and-bound algorithms for concave minimization over polytopes 38
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems 38
Scheduling of Parallel Print Machines with Sequence-Dependent Setup Costs: A Real-World Case Study 38
Solving the problem of packing equal and unequal circles in a circular container 37
On the relation between concavity cuts and the surrogate dual for convex maximization problems 37
A new class of test functions for global optimization 37
Approximation algorithms for a class of global optimization problems 36
The global optimization of Morse clusters by potential energy transformations 35
Necessary and sufficient global optimization conditions for convex maximization revisited 35
On testing global optimization algorithms for space trajectory design 35
Machine learning for global optimization 35
Non polyhedral convex envelopes for 1-convex functions 35
Solving molecular distance geometry problems by global optimization algorithms 35
Experimental Analysys of a Population-Based Approach for Difficult Global Optimization Problems 35
Branch and cut algorithms for detecting critical nodes in undirected graphs 35
Efficient solution algorithms for the Bounded Acceleration Shortest Path problem 35
Fast numerical solution of optimal control problems for switched systems: An application to path planning 34
Dissimilarity Measures for Population-Based Global Optimization Algorithms 34
Path planning with limited numbers of maneuvers for automatic guided vehicles: An optimization-based approach 34
Totale 4.604
Categoria #
all - tutte 22.012
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 22.012


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019149 0 0 0 0 0 0 0 0 0 5 139 5
2019/20201.321 241 274 70 8 106 99 137 32 99 125 42 88
2020/2021587 5 78 54 15 83 28 70 21 130 17 82 4
2021/2022545 29 22 10 18 7 12 46 72 34 45 13 237
2022/20231.933 250 209 112 143 142 237 13 107 625 13 52 30
2023/2024544 48 73 31 19 69 169 37 41 34 23 0 0
Totale 5.580