CRIS Current Research Information System

MALAGUTI, ENRICO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.489
AS - Asia 3.632
EU - Europa 2.801
AF - Africa 354
SA - Sud America 227
Continente sconosciuto - Info sul continente non disponibili 2
OC - Oceania 2
Totale 12.507
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.426
SG - Singapore 1.078
VN - Vietnam 966
IT - Italia 892
CN - Cina 836
GB - Regno Unito 448
DE - Germania 309
HK - Hong Kong 223
FR - Francia 191
SE - Svezia 171
NL - Olanda 168
BR - Brasile 150
IN - India 143
RU - Federazione Russa 136
TG - Togo 122
CI - Costa d'Avorio 106
IE - Irlanda 101
KR - Corea 92
UA - Ucraina 71
ZA - Sudafrica 69
FI - Finlandia 58
JP - Giappone 49
BG - Bulgaria 46
AT - Austria 38
CA - Canada 35
AR - Argentina 34
EE - Estonia 33
JO - Giordania 33
TR - Turchia 33
ID - Indonesia 30
CH - Svizzera 25
BD - Bangladesh 22
MX - Messico 20
PH - Filippine 20
BE - Belgio 19
PL - Polonia 18
GR - Grecia 16
IQ - Iraq 13
SA - Arabia Saudita 13
SC - Seychelles 13
TH - Thailandia 13
ES - Italia 12
NG - Nigeria 12
EC - Ecuador 11
RO - Romania 11
CO - Colombia 10
UZ - Uzbekistan 10
CL - Cile 9
MY - Malesia 9
TW - Taiwan 9
DZ - Algeria 8
HR - Croazia 8
MA - Marocco 8
PK - Pakistan 8
RS - Serbia 6
AE - Emirati Arabi Uniti 5
CZ - Repubblica Ceca 5
KE - Kenya 5
PY - Paraguay 5
DK - Danimarca 4
IL - Israele 4
IR - Iran 4
NP - Nepal 4
SI - Slovenia 4
TN - Tunisia 4
LT - Lituania 3
VE - Venezuela 3
BA - Bosnia-Erzegovina 2
JM - Giamaica 2
LB - Libano 2
MO - Macao, regione amministrativa speciale della Cina 2
MU - Mauritius 2
PE - Perù 2
PS - Palestinian Territory 2
QA - Qatar 2
TT - Trinidad e Tobago 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AO - Angola 1
AU - Australia 1
BJ - Benin 1
BO - Bolivia 1
BY - Bielorussia 1
CV - Capo Verde 1
DO - Repubblica Dominicana 1
EG - Egitto 1
ET - Etiopia 1
EU - Europa 1
GE - Georgia 1
HN - Honduras 1
HU - Ungheria 1
KG - Kirghizistan 1
KW - Kuwait 1
KZ - Kazakistan 1
LA - Repubblica Popolare Democratica del Laos 1
LI - Liechtenstein 1
MD - Moldavia 1
MN - Mongolia 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
OM - Oman 1
Totale 12.502
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.563
Singapore 647
Fairfield 415
Ashburn 410
Southend 368
Bologna 283
Chandler 241
Ho Chi Minh City 222
Hong Kong 201
Woodbridge 200
Seattle 193
Hanoi 190
Santa Clara 190
Wilmington 184
San Jose 183
Hefei 182
Houston 152
Cambridge 141
Lomé 122
Dallas 118
Princeton 116
Abidjan 106
Dublin 99
Beijing 88
Boardman 87
Dong Ket 82
Seoul 81
Milan 70
Lauterbourg 61
Los Angeles 52
Sofia 44
Westminster 44
Nanjing 43
Tappahannock 43
Tokyo 41
Berlin 40
Padova 38
New York 37
Helsinki 34
The Dalles 34
Amman 33
Jacksonville 33
Cesena 31
San Diego 29
Da Nang 28
Johannesburg 28
Council Bluffs 27
Jinan 27
Turin 27
Rome 26
Saint Petersburg 26
Chicago 25
Haiphong 25
Vienna 25
Redondo Beach 24
Frankfurt am Main 23
Casalecchio di Reno 22
Shenyang 21
Bengaluru 20
Jakarta 20
Munich 20
Buffalo 19
Des Moines 19
Shanghai 19
Brussels 18
Bern 16
Hebei 16
Lappeenranta 16
Medford 16
Nuremberg 15
Amsterdam 14
Guangzhou 14
Zhengzhou 14
Nanchang 13
São Paulo 13
Changsha 12
Hangzhou 11
Montreal 11
Moscow 11
Mülheim 11
Parma 11
Biên Hòa 10
Buenos Aires 10
Castel Maggiore 10
London 10
Ninh Bình 10
Orem 10
Toronto 10
Warsaw 10
Ningbo 9
Sulbiate 9
Atlanta 8
Can Tho 8
Düsseldorf 8
La Crescenta-Montrose 8
Phủ Lý 8
Quận Bình Thạnh 8
Tashkent 8
Tianjin 8
Venice 8
Totale 8.444
Salva come PNG Salva come JPEG
Nome #
A Metaheuristic Approach for the Vertex Coloring Problem 405
Integer optimization with penalized fractional values: The Knapsack case 339
Nonlinear chance-constrained problems with applications to hydro scheduling 307
K-adaptability in stochastic optimization 291
Models and algorithms for integrated production and distribution problems 289
(k, c) − coloring via Column Generation 288
An exact approach for the Vertex Coloring Problem 275
Approaches to real world two-dimensional cutting problems 258
On-line strategy selection for reducing overcrowding in an Emergency Department 257
Algorithms for the Bin Packing Problem with Conflicts 252
A decision support system for scheduling a vaccination campaign during a pandemic emergency: The COVID-19 case 251
A Freight Service Design Problem for a Railway Corridor 246
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming 237
Automatic Dantzig–Wolfe reformulation of mixed integer programs 233
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation 233
A Survey on Vertex Coloring Problems 232
A branch-and-bound algorithm for the knapsack problem with conflict graph 230
Mathematical formulations for the Balanced Vertex k-Separator Problem 225
Exact weighted vertex coloring via branch-and-price 224
A Column Generation Heuristic for the Two-Dimensional Cutting Stock Problem with Multiple Stock Size 222
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem 220
Models and Heuristic Algorithms for a Weighted Vertex Coloring Problem 215
Optimizing relocation operations in electric car-sharing 215
Overview of Optimization Problems in Electric Car-Sharing System Design and Management 214
The traveling salesman problem with pickups, deliveries, and draft limits 213
Training software for orthogonal packing problems 210
A Service Design Problem for a Railway Network 203
The vertex k-cut problem 203
The Vertex Coloring Problem and Its Generalizations 200
An Evolutionary Approach for Bandwidth Multicoloring Problems 199
On integer and bilevel formulations for the k-vertex cut problem 199
ILP Models and Column Generation for the Minimum Sum Coloring Problem 189
Models for the two-dimensional two-stage cutting stock problem with multiple stock size 188
Adjustable robust optimization with objective uncertainty 187
A metaheuristic framework for Nonlinear Capacitated Covering Problems 187
Test-Assignment: A Quadratic Coloring Problem 186
Design and control of public-service contracts and an application to public transportation systems 186
Solving vertex coloring problems as maximum weight stable set problems 183
Optimizing allocation in a warehouse network 183
In search of dense subgraphs: How good is greedy peeling? 183
A branch-and-price algorithm for the (k,c)-coloring problem 182
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem 181
An exact algorithm for the Partition Coloring Problem 180
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation 177
Discrete Programming Entailing Circulant Quadratic Forms: Refinement of a Heuristic Approach Based on ΔΣ Modulation 174
Efficient and Fair Routing for Mesh Networks 171
Computing k different solutions to the assignment problem 170
Adjustable Robust Optimization with Discrete Uncertainty 170
Scheduling of semi-automatic carousels with fixed production sequences 166
Models and algorithms for optimising two-dimensional LEGO constructions 160
Preface 158
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems 154
An iterated local search matheuristic approach for the multi-vehicle inventory routing problem 144
A note on selective line-graphs and partition colorings 144
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions 139
Guest Editorial to the Feature Cluster “New Trends in Applied Combinatorial Optimization” (EURO/ALIO 2018) 138
A branch-and-price algorithm for the Minimum Sum Coloring Problem 136
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation 122
The min-Knapsack problem with compactness constraints and applications in statistics 116
A Service Design Problem for a Railway Corridor 115
Efficient and Fair Routing for Ad-Hoc Telecommunication Networks 105
A new formulation for the Weighted Safe Set Problem 92
A pseudo-polynomial size formulation for 2-stage 2-dimensional knapsack problems 78
Techniques for finding a list of solutions with increasing costs for the semi-assignment problem 61
Models and algorithms for the Weighted Safe Set Problem 48
Algorithms and complexity results for the 0–1 knapsack problem with group fairness 39
Totale 12.777
Salva come PNG Salva come JPEG
Categoria #
all - tutte 31.463
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 31.463
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021261 0 0 0 0 0 0 0 0 0 40 29 192
2021/20222.529 98 28 276 239 307 223 248 269 327 110 228 176
2022/20231.343 104 196 55 138 95 91 107 80 249 38 114 76
2023/2024522 26 69 28 28 32 72 54 54 27 64 36 32
2024/20252.250 57 248 214 147 408 103 226 125 40 171 138 373
2025/20263.612 417 331 368 292 423 191 399 152 699 340 0 0
Totale 12.777