GROSSO, Andrea Cesare
 Distribuzione geografica
Continente #
NA - Nord America 3.790
EU - Europa 2.585
AS - Asia 827
AF - Africa 14
SA - Sud America 7
OC - Oceania 5
Continente sconosciuto - Info sul continente non disponibili 4
Totale 7.232
Nazione #
US - Stati Uniti d'America 3.699
DK - Danimarca 581
IT - Italia 468
CN - Cina 436
DE - Germania 264
SE - Svezia 247
IE - Irlanda 236
FR - Francia 174
FI - Finlandia 133
UA - Ucraina 131
SG - Singapore 114
GB - Regno Unito 93
CA - Canada 89
KR - Corea 85
PL - Polonia 76
VN - Vietnam 45
RU - Federazione Russa 33
ID - Indonesia 31
ES - Italia 28
BE - Belgio 27
HK - Hong Kong 26
CH - Svizzera 21
IN - India 21
NL - Olanda 21
IR - Iran 17
JP - Giappone 17
GR - Grecia 15
TR - Turchia 12
CZ - Repubblica Ceca 10
MA - Marocco 9
TW - Taiwan 9
AE - Emirati Arabi Uniti 8
PT - Portogallo 8
AU - Australia 5
BR - Brasile 5
AT - Austria 4
EU - Europa 4
RO - Romania 4
DZ - Algeria 3
HU - Ungheria 3
LU - Lussemburgo 3
MX - Messico 2
NO - Norvegia 2
PK - Pakistan 2
BG - Bulgaria 1
BN - Brunei Darussalam 1
EC - Ecuador 1
ET - Etiopia 1
HR - Croazia 1
KZ - Kazakistan 1
MD - Moldavia 1
MU - Mauritius 1
MY - Malesia 1
PH - Filippine 1
UY - Uruguay 1
Totale 7.232
Città #
Ann Arbor 853
Chandler 356
Dublin 233
Beijing 231
Dearborn 176
Wilmington 153
Ashburn 151
Engelhard 148
Houston 134
Fairfield 133
Guangzhou 124
Jacksonville 114
Torino 100
Villeurbanne 83
Woodbridge 79
Singapore 76
Warsaw 76
Milan 67
Princeton 63
Turin 63
Medford 61
Chicago 59
Nyköping 59
Seattle 51
Pisa 49
Toronto 45
Cambridge 37
Redwood City 36
Helsinki 27
La Veta 27
Dong Ket 26
Jakarta 26
Boston 25
Brussels 24
Colorado Springs 23
Fremont 21
Ottawa 21
Padova 20
Bern 18
Boardman 17
St. George 17
Del Norte 15
Norwalk 15
Pacific Palisades 15
San Diego 14
Washington 14
Athens 13
Limena 12
Nanjing 12
Santa Clara 12
Tours 12
Mt. Dora 11
Los Angeles 10
New York 10
Rome 10
Salt Lake City 10
Grafing 9
London 9
City of Westminster 8
Falls Church 8
Lyon 8
North Hollywood 8
Paris 8
Taipei 8
Wayne 8
Kunming 7
San Mauro Torinese 7
Valencia 7
Verona 7
Dresden 6
Hefei 6
Karlsruhe 6
Lachine 6
Minneapolis 6
Nizhniy Novgorod 6
Nuremberg 6
Phoenix 6
Prague 6
San Jose 6
Trois-Rivières 6
Bologna 5
Central 5
Edinburgh 5
Hangzhou 5
Lappeenranta 5
Mountain View 5
Azilal 4
Burbank 4
Collegno 4
Fairfax 4
Frankfurt am Main 4
Jinan 4
Kowloon City 4
Montréal 4
Nanning 4
Naples 4
Nichelino 4
Nürnberg 4
Parma 4
Porto 4
Totale 4.541
Nome #
Simple but effective heuristics for the 2-Constraint Bin Packing Problem 401
Hybrid constructive heuristics for the critical node problem 396
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem 357
Local Search Metaheuristics for the Critical Node Problem 344
A preliminary analysis of the Distance Based Critical Node Problem 318
A Genetic Algorithm for a class of Critical Node Problems 295
A General Evolutionary Framework for different classes of Critical Node Problems 289
Construction and improvement algorithms for dispersion problems 282
VNS solutions for the critical node problem 251
Operating room scheduling and rescheduling: a rolling horizon approach. 232
Column generation bounds on a network flow model to minimize the total weighted completion time for a single parallel batching machine 228
Local search and pseudoinversion: an hybrid approach to neural network training 186
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 155
Branch and cut algorithms for detecting critical nodes in undirected graphs 145
Computational Experience with Pseudoinversion-Based Training of Neural Networks Using Random Projection Matrices 143
Advanced workforce management in healthcare 138
Complexity of the critical node problem over trees 132
Workforce Management based on forecasted demand 130
Searching for a cycle with maximum coverage in undirected graphs 128
A Hybrid Algorithm based on Gray Petri Net and Tabu Search for staffing Health Care Personnel 127
A matheuristic approach for the two-machine total completion time flow shop problem 125
A single machine scheduling problem with two-dimensional vector packing constraints 124
Models for Multi-Skilled Rostering in Health Care 118
Combining petri nets and metaheuristics for the optimal composition of medical teams 105
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth 104
The daily swab test collection problem 104
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 99
Neural Networks for Wind Power Generation Forecasting: a Case Study 96
Algorithmic paradoxes of the single machine total tardiness problem 95
The Connected Critical Node Problem 87
Models for the optimal composition of medical crews in emergency services 84
An enhanced dynasearch neighborhood for the single machine total weighted tardiness scheduling problem 79
Experimental Analysys of a Population-Based Approach for Difficult Global Optimization Problems 74
A maximum node clustering problem 73
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 72
Solving molecular distance geometry problems by global optimization algorithms 71
A heuristic approach for the max–min diversity problem based on max-clique 71
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 71
Logical topologies design over WDM wavelength-routed networks robust to traffic uncertainties 68
A new decomposition approach for the single-machine total tardiness problem 67
An experimental analysis of a population based approach for global optimization 66
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances 64
Finding maximin latin hypercube designs by Iterated Local Search heuristics 62
Column generation for minimizing total completion time on a single machine with parallel batching 62
A population based approach for hard global optimization problems based on dissimilarity measures 61
Computational experience with a core-based reduction procedure for the2-knapsack problem 59
Solution of the single machine total tardiness problem 57
Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine 56
Finding the Pareto optima for the total and maximum tardiness single machine scheduling problem 54
Column generation for minimizing total completion time in a parallel-batching environment 54
Optimal facility location with random throughput costs 49
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem 47
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 46
Simple ingredients leading to very efficient heuristics for the maximum clique problem 45
Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness scheduling problem 40
Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic 40
Solving the problem of packing equal and unequal circles in a circular container 32
Simplex algorithms for linear programming 32
Task and Memory Mapping of Large Size Embedded Applications over NUMA architecture✱ 28
Polynomial-Size ILP formulations for the Total Completion Time Problem on a Parallel Batching Machine 24
Polynomial-Size Models to Minimize Total Completion Time in a Parallel Batching Environment 22
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem 21
Constructive and Destructive Methods in Heuristic Search 19
Job Shop Scheduling via Deep Reinforcement Learning: A Sequence to Sequence Approach 17
Totale 7.521
Categoria #
all - tutte 18.732
article - articoli 0
book - libri 0
conference - conferenze 5.256
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 23.988


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.335 0 0 0 195 150 250 162 68 157 118 115 120
2020/20211.311 108 77 77 82 122 136 111 98 171 142 122 65
2021/2022691 20 49 33 74 32 26 30 40 21 46 161 159
2022/20231.105 111 99 29 125 85 266 97 69 107 10 57 50
2023/2024917 94 105 61 118 138 74 43 38 9 60 68 109
2024/2025345 146 85 93 21 0 0 0 0 0 0 0 0
Totale 7.521