CRIS Current Research Information System

MALAGUTI, ENRICO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.577
EU - Europa 1.895
AS - Asia 1.125
AF - Africa 224
SA - Sud America 29
Continente sconosciuto - Info sul continente non disponibili 2
OC - Oceania 1
Totale 7.853
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.563
IT - Italia 555
GB - Regno Unito 422
SG - Singapore 400
CN - Cina 375
DE - Germania 224
VN - Vietnam 167
SE - Svezia 158
TG - Togo 122
IE - Irlanda 92
IN - India 85
FR - Francia 76
UA - Ucraina 68
RU - Federazione Russa 63
CI - Costa d'Avorio 49
BG - Bulgaria 46
ZA - Sudafrica 36
FI - Finlandia 34
EE - Estonia 33
JO - Giordania 31
CH - Svizzera 24
NL - Olanda 21
AT - Austria 18
BE - Belgio 16
ID - Indonesia 15
BR - Brasile 12
CA - Canada 11
GR - Grecia 11
HK - Hong Kong 11
JP - Giappone 11
AR - Argentina 10
TR - Turchia 9
HR - Croazia 7
NG - Nigeria 7
PL - Polonia 7
CZ - Repubblica Ceca 4
DZ - Algeria 4
PK - Pakistan 4
RS - Serbia 4
SC - Seychelles 4
EC - Ecuador 3
IR - Iran 3
RO - Romania 3
SI - Slovenia 3
UZ - Uzbekistan 3
CL - Cile 2
MU - Mauritius 2
MX - Messico 2
PE - Perù 2
PH - Filippine 2
TW - Taiwan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AE - Emirati Arabi Uniti 1
AU - Australia 1
BD - Bangladesh 1
DK - Danimarca 1
ES - Italia 1
EU - Europa 1
KR - Corea 1
LA - Repubblica Popolare Democratica del Laos 1
LB - Libano 1
LI - Liechtenstein 1
LT - Lituania 1
MD - Moldavia 1
NO - Norvegia 1
PA - Panama 1
SA - Arabia Saudita 1
TH - Thailandia 1
Totale 7.853
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.563
Fairfield 415
Southend 368
Ashburn 300
Singapore 245
Chandler 241
Woodbridge 200
Seattle 191
Santa Clara 186
Wilmington 183
Bologna 162
Houston 148
Cambridge 141
Lomé 122
Princeton 116
Dublin 91
Dong Ket 82
Boardman 81
Abidjan 49
Sofia 44
Westminster 44
Nanjing 43
Tappahannock 43
Berlin 38
Milan 35
Jacksonville 33
Padova 33
Amman 31
San Diego 29
Helsinki 27
Jinan 26
Saint Petersburg 26
Turin 26
Casalecchio di Reno 22
Rome 21
Shenyang 20
Beijing 18
Bern 16
Brussels 16
Hebei 16
Medford 16
Des Moines 14
Zhengzhou 14
Jakarta 13
Nanchang 13
New York 13
Shanghai 13
Vienna 13
Mülheim 11
Changsha 10
Chicago 10
Los Angeles 10
Guangzhou 9
Ningbo 9
Parma 9
Buenos Aires 8
Tokyo 8
Abeokuta 7
Ravenna 7
Taizhou 7
Tianjin 7
Bollate 6
Bursa 6
Bühl 6
Dearborn 6
Fremont 6
Fuzhou 6
Haikou 6
Hangzhou 6
London 6
Salvaterra 6
Taiyuan 6
Wuhan 6
Blue Bell 5
Jiaxing 5
Lappeenranta 5
Muri bei Bern 5
Nuremberg 5
Redwood City 5
Shenzhen 5
Toronto 5
Verona 5
Albignasego 4
Belgrade 4
Bo 4
Campinas 4
Chengdu 4
Edinburgh 4
Frankfurt am Main 4
Hung Hom 4
Kunming 4
Lanzhou 4
Mahé 4
Naples 4
Norwalk 4
Olalla 4
Paris 4
Phoenix 4
Quanzhou 4
Redmond 4
Totale 5.901
Salva come PNG Salva come JPEG
Nome #
Nonlinear chance-constrained problems with applications to hydro scheduling 201
Integer optimization with penalized fractional values: The Knapsack case 196
Exact weighted vertex coloring via branch-and-price 192
An exact approach for the Vertex Coloring Problem 192
Approaches to real world two-dimensional cutting problems 191
(k, c) − coloring via Column Generation 182
A Metaheuristic Approach for the Vertex Coloring Problem 181
A Survey on Vertex Coloring Problems 181
Automatic Dantzig–Wolfe reformulation of mixed integer programs 181
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming 180
A branch-and-bound algorithm for the knapsack problem with conflict graph 177
A Freight Service Design Problem for a Railway Corridor 177
Algorithms for the Bin Packing Problem with Conflicts 175
Overview of Optimization Problems in Electric Car-Sharing System Design and Management 173
Models and algorithms for integrated production and distribution problems 171
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation 167
A Column Generation Heuristic for the Two-Dimensional Cutting Stock Problem with Multiple Stock Size 166
The traveling salesman problem with pickups, deliveries, and draft limits 166
Models and Heuristic Algorithms for a Weighted Vertex Coloring Problem 165
Optimizing relocation operations in electric car-sharing 162
Mathematical formulations for the Balanced Vertex k-Separator Problem 160
Training software for orthogonal packing problems 159
A Service Design Problem for a Railway Network 155
The Vertex Coloring Problem and Its Generalizations 155
An Evolutionary Approach for Bandwidth Multicoloring Problems 153
The vertex k-cut problem 149
ILP Models and Column Generation for the Minimum Sum Coloring Problem 147
A branch-and-price algorithm for the (k,c)-coloring problem 146
On integer and bilevel formulations for the k-vertex cut problem 145
A metaheuristic framework for Nonlinear Capacitated Covering Problems 142
Models for the two-dimensional two-stage cutting stock problem with multiple stock size 139
Efficient and Fair Routing for Mesh Networks 139
An exact algorithm for the Partition Coloring Problem 139
Optimizing allocation in a warehouse network 138
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem 137
Test-Assignment: A Quadratic Coloring Problem 137
Solving vertex coloring problems as maximum weight stable set problems 136
Design and control of public-service contracts and an application to public transportation systems 135
Computing k different solutions to the assignment problem 135
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation 124
Preface 123
A note on selective line-graphs and partition colorings 119
K-adaptability in stochastic optimization 117
A decision support system for scheduling a vaccination campaign during a pandemic emergency: The COVID-19 case 105
In search of dense subgraphs: How good is greedy peeling? 104
Discrete Programming Entailing Circulant Quadratic Forms: Refinement of a Heuristic Approach Based on ΔΣ Modulation 98
A branch-and-price algorithm for the Minimum Sum Coloring Problem 96
A Service Design Problem for a Railway Corridor 92
Models and algorithms for optimising two-dimensional LEGO constructions 87
Scheduling of semi-automatic carousels with fixed production sequences 79
Guest Editorial to the Feature Cluster “New Trends in Applied Combinatorial Optimization” (EURO/ALIO 2018) 77
Efficient and Fair Routing for Ad-Hoc Telecommunication Networks 75
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem 65
A new formulation for the Weighted Safe Set Problem 56
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems 50
A pseudo-polynomial size formulation for 2-stage 2-dimensional knapsack problems 43
Adjustable Robust Optimization with Discrete Uncertainty 41
Adjustable robust optimization with objective uncertainty 39
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions 36
The min-Knapsack problem with compactness constraints and applications in statistics 35
On-line strategy selection for reducing overcrowding in an Emergency Department 33
Techniques for finding a list of solutions with increasing costs for the semi-assignment problem 29
Models and algorithms for the Weighted Safe Set Problem 13
Totale 8.058
Salva come PNG Salva come JPEG
Categoria #
all - tutte 19.750
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 19.750
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020937 0 0 0 0 0 141 176 183 180 116 43 98
2020/2021810 153 126 63 21 8 30 19 42 87 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/20251.143 57 248 214 147 408 69 0 0 0 0 0 0
Totale 8.058