GROSSO, Andrea Cesare
 Distribuzione geografica
Continente #
NA - Nord America 3.578
EU - Europa 2.482
AS - Asia 674
AF - Africa 8
OC - Oceania 5
SA - Sud America 5
Continente sconosciuto - Info sul continente non disponibili 4
Totale 6.756
Nazione #
US - Stati Uniti d'America 3.491
DK - Danimarca 581
CN - Cina 432
IT - Italia 378
DE - Germania 260
SE - Svezia 247
IE - Irlanda 236
FR - Francia 174
FI - Finlandia 132
UA - Ucraina 131
GB - Regno Unito 89
CA - Canada 85
KR - Corea 84
PL - Polonia 76
VN - Vietnam 45
RU - Federazione Russa 33
ES - Italia 28
BE - Belgio 26
CH - Svizzera 20
IN - India 20
NL - Olanda 20
HK - Hong Kong 18
IR - Iran 16
GR - Grecia 15
JP - Giappone 15
TR - Turchia 12
CZ - Repubblica Ceca 10
TW - Taiwan 9
AE - Emirati Arabi Uniti 7
PT - Portogallo 7
SG - Singapore 6
AU - Australia 5
AT - Austria 4
BR - Brasile 4
EU - Europa 4
ID - Indonesia 4
RO - Romania 4
DZ - Algeria 3
HU - Ungheria 3
LU - Lussemburgo 3
MA - Marocco 3
MX - Messico 2
NO - Norvegia 2
PK - Pakistan 2
BG - Bulgaria 1
BN - Brunei Darussalam 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 6.756
Città #
Ann Arbor 853
Chandler 356
Dublin 233
Beijing 231
Dearborn 176
Wilmington 153
Ashburn 147
Houston 134
Fairfield 133
Guangzhou 124
Jacksonville 114
Engelhard 110
Torino 100
Villeurbanne 83
Woodbridge 79
Warsaw 76
Princeton 63
Medford 61
Nyköping 59
Seattle 51
Pisa 49
Toronto 45
Cambridge 37
Redwood City 36
Turin 29
Helsinki 27
La Veta 27
Dong Ket 26
Boston 25
Milan 24
Brussels 23
Colorado Springs 23
Chicago 21
Fremont 21
Ottawa 21
Padova 20
Bern 17
Boardman 17
St. George 17
Norwalk 15
Pacific Palisades 15
San Diego 14
Washington 14
Athens 13
Limena 12
Nanjing 12
Tours 12
Mt. Dora 11
Los Angeles 10
New York 10
Rome 10
Del Norte 9
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
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
Karlsruhe 5
Mountain View 5
Burbank 4
Collegno 4
Fairfax 4
Jinan 4
Lappeenranta 4
Montréal 4
Nanning 4
Naples 4
Nichelino 4
Nürnberg 4
Porto 4
Renton 4
Salt Lake City 4
San Mateo 4
Shanghai 4
Tokyo 4
Wuhan 4
Auburn Hills 3
Bonn 3
Totale 4.264
Nome #
Simple but effective heuristics for the 2-Constraint Bin Packing Problem 376
Hybrid constructive heuristics for the critical node problem 374
Local Search Metaheuristics for the Critical Node Problem 322
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem 322
A preliminary analysis of the Distance Based Critical Node Problem 295
A Genetic Algorithm for a class of Critical Node Problems 284
A General Evolutionary Framework for different classes of Critical Node Problems 269
Construction and improvement algorithms for dispersion problems 259
VNS solutions for the critical node problem 243
Operating room scheduling and rescheduling: a rolling horizon approach. 230
Column generation bounds on a network flow model to minimize the total weighted completion time for a single parallel batching machine 195
Local search and pseudoinversion: an hybrid approach to neural network training 182
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 151
Branch and cut algorithms for detecting critical nodes in undirected graphs 140
Computational Experience with Pseudoinversion-Based Training of Neural Networks Using Random Projection Matrices 138
Advanced workforce management in healthcare 129
Workforce Management based on forecasted demand 127
Complexity of the critical node problem over trees 125
Searching for a cycle with maximum coverage in undirected graphs 125
A Hybrid Algorithm based on Gray Petri Net and Tabu Search for staffing Health Care Personnel 123
A matheuristic approach for the two-machine total completion time flow shop problem 122
A single machine scheduling problem with two-dimensional vector packing constraints 121
Models for Multi-Skilled Rostering in Health Care 116
Combining petri nets and metaheuristics for the optimal composition of medical teams 104
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth 102
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 98
Neural Networks for Wind Power Generation Forecasting: a Case Study 94
Algorithmic paradoxes of the single machine total tardiness problem 92
Models for the optimal composition of medical crews in emergency services 83
An enhanced dynasearch neighborhood for the single machine total weighted tardiness scheduling problem 78
A maximum node clustering problem 72
Solving molecular distance geometry problems by global optimization algorithms 70
Experimental Analysys of a Population-Based Approach for Difficult Global Optimization Problems 70
A heuristic approach for the max–min diversity problem based on max-clique 69
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 69
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 67
A new decomposition approach for the single-machine total tardiness problem 65
Logical topologies design over WDM wavelength-routed networks robust to traffic uncertainties 63
An experimental analysis of a population based approach for global optimization 63
The daily swab test collection problem 62
Finding maximin latin hypercube designs by Iterated Local Search heuristics 61
The Connected Critical Node Problem 60
A population based approach for hard global optimization problems based on dissimilarity measures 60
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances 60
Computational experience with a core-based reduction procedure for the2-knapsack problem 58
Column generation for minimizing total completion time on a single machine with parallel batching 58
Solution of the single machine total tardiness problem 54
Finding the Pareto optima for the total and maximum tardiness single machine scheduling problem 52
Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine 48
Column generation for minimizing total completion time in a parallel-batching environment 48
Optimal facility location with random throughput costs 45
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 45
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem 44
Simple ingredients leading to very efficient heuristics for the maximum clique problem 41
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 35
Solving the problem of packing equal and unequal circles in a circular container 31
Simplex algorithms for linear programming 30
Polynomial-Size ILP formulations for the Total Completion Time Problem on a Parallel Batching Machine 20
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem 20
Polynomial-Size Models to Minimize Total Completion Time in a Parallel Batching Environment 19
Task and Memory Mapping of Large Size Embedded Applications over NUMA architecture✱ 16
Job Shop Scheduling via Deep Reinforcement Learning: A Sequence to Sequence Approach 10
Totale 7.044
Categoria #
all - tutte 16.360
article - articoli 0
book - libri 0
conference - conferenze 4.556
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 20.916


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019182 0 0 0 0 0 0 0 0 0 0 135 47
2019/20201.569 47 52 135 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/2024785 94 105 61 118 138 74 43 38 9 60 45 0
Totale 7.044