CINECA IRIS Institutional Research Information System

GROSSO, Andrea Cesare
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2945
EU - Europa 2255
AS - Asia 646
AF - Africa 8
SA - Sud America 5
Continente sconosciuto - Info sul continente non disponibili 4
OC - Oceania 3
Totale 5866
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2895
DK - Danimarca 580
CN - Cina 428
IT - Italia 307
SE - Svezia 246
DE - Germania 226
IE - Irlanda 219
FR - Francia 150
UA - Ucraina 129
FI - Finlandia 111
KR - Corea 83
PL - Polonia 75
GB - Regno Unito 63
CA - Canada 48
VN - Vietnam 45
BE - Belgio 31
RU - Federazione Russa 27
ES - Italia 23
NL - Olanda 18
IN - India 16
IR - Iran 16
CH - Svizzera 14
JP - Giappone 14
TR - Turchia 11
GR - Grecia 10
HK - Hong Kong 10
AE - Emirati Arabi Uniti 7
CZ - Repubblica Ceca 7
PT - Portogallo 6
TW - Taiwan 6
BR - Brasile 4
EU - Europa 4
RO - Romania 4
AT - Austria 3
AU - Australia 3
DZ - Algeria 3
MA - Marocco 3
SG - Singapore 3
HU - Ungheria 2
ID - Indonesia 2
LU - Lussemburgo 2
MX - Messico 2
NO - Norvegia 2
PK - Pakistan 2
ET - Etiopia 1
KZ - Kazakistan 1
MU - Mauritius 1
MY - Malesia 1
PH - Filippine 1
UY - Uruguay 1
Totale 5866
Salva come PNG Salva come JPEG
Città #
Ann Arbor 853
Chandler 356
Beijing 231
Dublin 216
Dearborn 176
Wilmington 153
Houston 134
Fairfield 133
Guangzhou 124
Jacksonville 114
Torino 100
Villeurbanne 83
Woodbridge 79
Warsaw 75
Princeton 63
Medford 61
Nyköping 58
Ashburn 49
Seattle 49
Pisa 44
Cambridge 37
Brussels 30
Dong Ket 26
Boston 25
Redwood City 25
Milan 22
Fremont 21
Ottawa 21
Padova 19
Boardman 17
Toronto 16
Norwalk 15
San Diego 14
Bern 12
Nanjing 12
Helsinki 10
Rome 10
Athens 9
Grafing 9
Falls Church 8
Wayne 8
Kunming 7
Turin 7
Verona 7
Hefei 6
Lachine 6
Lyon 6
Paris 6
Phoenix 6
Taipei 6
Bologna 5
Hangzhou 5
Karlsruhe 5
Mountain View 5
Collegno 4
Jinan 4
Minneapolis 4
Montréal 4
Nanning 4
Naples 4
Nichelino 4
Nürnberg 4
Porto 4
Renton 4
San Mateo 4
Tokyo 4
Tours 4
Valencia 4
Wuhan 4
Auburn Hills 3
Lake Forest 3
Nanchang 3
Nancy 3
New York 3
Prague 3
Saint-étienne 3
San Francisco 3
San Pedro del Pinatar 3
San Raffaele Cimena 3
Shanghai 3
Abano Terme 2
Algiers 2
Barcelona 2
Bucharest 2
Changchun 2
Coimbatore 2
Cork 2
Düsseldorf 2
Florence 2
Garessio 2
Hebei 2
Istanbul 2
Kolkata 2
Leinì 2
Linköping 2
Los Angeles 2
Most 2
Munich 2
Napoli 2
New Delhi 2
Totale 3727
Salva come PNG Salva come JPEG
Nome #
Simple but effective heuristics for the 2-Constraint Bin Packing Problem 335
Hybrid constructive heuristics for the critical node problem 324
Local Search Metaheuristics for the Critical Node Problem 287
A preliminary analysis of the Distance Based Critical Node Problem 272
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem 269
A Genetic Algorithm for a class of Critical Node Problems 261
A General Evolutionary Framework for different classes of Critical Node Problems 242
Operating room scheduling and rescheduling: a rolling horizon approach. 213
VNS solutions for the critical node problem 212
Construction and improvement algorithms for dispersion problems 210
Local search and pseudoinversion: an hybrid approach to neural network training 174
Branch and cut algorithms for detecting critical nodes in undirected graphs 130
Computational Experience with Pseudoinversion-Based Training of Neural Networks Using Random Projection Matrices 128
Advanced workforce management in healthcare 123
Complexity of the critical node problem over trees 121
Workforce Management based on forecasted demand 120
Column generation bounds on a network flow model to minimize the total weighted completion time for a single parallel batching machine 120
Searching for a cycle with maximum coverage in undirected graphs 118
A single machine scheduling problem with two-dimensional vector packing constraints 115
A matheuristic approach for the two-machine total completion time flow shop problem 114
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 113
Models for Multi-Skilled Rostering in Health Care 111
A Hybrid Algorithm based on Gray Petri Net and Tabu Search for staffing Health Care Personnel 110
Combining petri nets and metaheuristics for the optimal composition of medical teams 100
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth 97
Algorithmic paradoxes of the single machine total tardiness problem 85
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 84
Neural Networks for Wind Power Generation Forecasting: a Case Study 82
Models for the optimal composition of medical crews in emergency services 73
An enhanced dynasearch neighborhood for the single machine total weighted tardiness scheduling problem 68
A maximum node clustering problem 67
A heuristic approach for the max–min diversity problem based on max-clique 66
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 66
Experimental Analysys of a Population-Based Approach for Difficult Global Optimization Problems 64
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 64
Solving molecular distance geometry problems by global optimization algorithms 63
A new decomposition approach for the single-machine total tardiness problem 57
An experimental analysis of a population based approach for global optimization 57
Logical topologies design over WDM wavelength-routed networks robust to traffic uncertainties 56
Finding maximin latin hypercube designs by Iterated Local Search heuristics 55
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances 55
A population based approach for hard global optimization problems based on dissimilarity measures 54
Solution of the single machine total tardiness problem 53
Computational experience with a core-based reduction procedure for the2-knapsack problem 53
Finding the Pareto optima for the total and maximum tardiness single machine scheduling problem 46
Column generation for minimizing total completion time on a single machine with parallel batching 44
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem 42
Optimal facility location with random throughput costs 41
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 41
Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine 39
Simple ingredients leading to very efficient heuristics for the maximum clique problem 35
Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic 35
Column generation for minimizing total completion time in a parallel-batching environment 35
Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness scheduling problem 34
Simplex algorithms for linear programming 29
Solving the problem of packing equal and unequal circles in a circular container 27
The daily swab test collection problem 15
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem 14
Polynomial-Size ILP formulations for the Total Completion Time Problem on a Parallel Batching Machine 11
Polynomial-Size Models to Minimize Total Completion Time in a Parallel Batching Environment 11
The Connected Critical Node Problem 9
Totale 6149
Salva come PNG Salva come JPEG
Categoria #
all - tutte 9460
article - articoli 0
book - libri 0
conference - conferenze 2656
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 12116
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2017/2018308 0000 00 00 1571033513
2018/2019472 16247 8109 1859 263213547
2019/20201569 4752135195 150250 16268 157118115120
2020/20211311 108777782 122136 11198 17114212265
2021/2022691 20493374 3226 3040 2146161159
2022/2023995 1119929125 85266 10774 99000
Totale 6149