MONACI, MICHELE
 Distribuzione geografica
Continente #
NA - Nord America 8.496
AS - Asia 4.889
EU - Europa 3.881
AF - Africa 547
SA - Sud America 381
Continente sconosciuto - Info sul continente non disponibili 332
OC - Oceania 7
Totale 18.533
Nazione #
US - Stati Uniti d'America 8.368
SG - Singapore 1.456
VN - Vietnam 1.187
IT - Italia 1.169
CN - Cina 1.158
GB - Regno Unito 718
DE - Germania 491
HK - Hong Kong 349
FR - Francia 319
BR - Brasile 274
CI - Costa d'Avorio 204
IN - India 192
SE - Svezia 190
RU - Federazione Russa 176
TG - Togo 153
UA - Ucraina 118
NL - Olanda 112
IE - Irlanda 111
ZA - Sudafrica 104
BD - Bangladesh 92
FI - Finlandia 72
HR - Croazia 71
CA - Canada 69
KR - Corea 68
JP - Giappone 62
EE - Estonia 60
AT - Austria 59
ID - Indonesia 59
AR - Argentina 41
PL - Polonia 40
TH - Thailandia 40
PH - Filippine 35
BG - Bulgaria 31
CH - Svizzera 31
TR - Turchia 27
NG - Nigeria 26
MX - Messico 24
MY - Malesia 24
JO - Giordania 23
SC - Seychelles 23
BE - Belgio 20
EC - Ecuador 20
IQ - Iraq 19
ES - Italia 16
SA - Arabia Saudita 16
PK - Pakistan 14
TW - Taiwan 14
CO - Colombia 13
CL - Cile 12
GR - Grecia 11
JM - Giamaica 11
RS - Serbia 11
CR - Costa Rica 10
TN - Tunisia 10
UZ - Uzbekistan 10
PY - Paraguay 8
SI - Slovenia 8
IL - Israele 7
EG - Egitto 6
IR - Iran 6
IS - Islanda 6
RO - Romania 6
DK - Danimarca 5
HU - Ungheria 5
LB - Libano 5
NP - Nepal 5
PE - Perù 5
VE - Venezuela 5
AU - Australia 4
CZ - Repubblica Ceca 4
LT - Lituania 4
MA - Marocco 4
AE - Emirati Arabi Uniti 3
ET - Etiopia 3
MO - Macao, regione amministrativa speciale della Cina 3
NZ - Nuova Zelanda 3
OM - Oman 3
PT - Portogallo 3
SN - Senegal 3
SV - El Salvador 3
AL - Albania 2
BA - Bosnia-Erzegovina 2
BH - Bahrain 2
BO - Bolivia 2
DO - Repubblica Dominicana 2
DZ - Algeria 2
HN - Honduras 2
KE - Kenya 2
KW - Kuwait 2
KZ - Kazakistan 2
LV - Lettonia 2
MD - Moldavia 2
MU - Mauritius 2
PA - Panama 2
SK - Slovacchia (Repubblica Slovacca) 2
BB - Barbados 1
BJ - Benin 1
BY - Bielorussia 1
CD - Congo 1
CV - Capo Verde 1
Totale 18.185
Città #
Ann Arbor 2.525
Singapore 766
Fairfield 626
Southend 584
Ashburn 523
San Jose 367
Wilmington 331
Hong Kong 314
Bologna 299
Woodbridge 288
Santa Clara 272
Seattle 269
Ho Chi Minh City 246
Houston 234
Chandler 227
Cambridge 221
Hanoi 213
Dallas 205
Abidjan 204
Beijing 158
Lomé 153
Princeton 152
Hefei 149
Boardman 138
Council Bluffs 132
Dong Ket 116
Dublin 111
Milan 85
Lauterbourg 84
Jacksonville 78
Padova 74
Los Angeles 73
The Dalles 71
Nanjing 70
Rome 70
Westminster 66
Berlin 60
Seoul 58
New York 57
Buffalo 56
Helsinki 48
Jinan 46
Tokyo 44
Da Nang 43
Jakarta 43
Haiphong 39
Shanghai 39
Johannesburg 38
San Diego 38
Frankfurt am Main 36
Saint Petersburg 36
Turin 36
Vienna 33
Bangkok 30
Paris 30
Shenyang 30
Sofia 28
Des Moines 27
Hebei 27
North Charleston 27
Nuremberg 27
Guangzhou 25
Abeokuta 23
Amman 23
Bengaluru 21
Orem 21
São Paulo 21
Brussels 20
Changsha 20
Hangzhou 20
London 20
Tianjin 20
Cesena 19
Chicago 19
Warsaw 19
Atlanta 18
Amsterdam 17
Medford 17
Bern 16
Lappeenranta 16
Montreal 16
Phoenix 16
Redondo Beach 16
Kuala Selangor 15
San Francisco 15
Jiaxing 14
Manila 14
Munich 14
Nanchang 14
Taiyuan 14
Toronto 14
Biên Hòa 13
Casalecchio di Reno 13
Karlsruhe 13
Leeds 13
Modena 13
Vicenza 13
Brooklyn 12
Can Tho 12
Falkenstein 12
Totale 12.121
Nome #
A Metaheuristic Approach for the Vertex Coloring Problem 411
Integer optimization with penalized fractional values: The Knapsack case 359
Energy-Efficient Train Control: A Practical Application 354
Two-dimensional Bin Packing Problems 334
Minimum tiling of a rectangle by squares 334
Models and algorithms for integrated production and distribution problems 306
K-adaptability in stochastic optimization 303
On-line strategy selection for reducing overcrowding in an Emergency Department 295
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 291
An exact approach for the Vertex Coloring Problem 285
Least cost influence propagation in (social) networks 276
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming 270
On the 2-Dimensional Knapsack Problem 261
A Set-Covering Based Heuristic Approach for Bin-Packing Problems 261
Passenger Railway Optimization 259
On the use of intersection cuts for bilevel optimization 249
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem 247
Algorithms for packing and scheduling problems 246
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing 231
A dynamic reformulation heuristic for Generalized Interdiction Problems 225
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem 221
Complexity and approximation of an area packing problem 221
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs 221
Models and Heuristic Algorithms for a Weighted Vertex Coloring Problem 219
A Fast and Efficient Algorithm to Exploit Multi-user Diversity in IEEE 802.16 BandAMC 217
Bidimensional Packing by Bilinear Programming 216
Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling 214
Bidimensional packing by bilinear programming 213
SelfSplit parallelization for mixed-integer linear programming 212
2DPackLib: a two-dimensional cutting and packing library 212
Adjustable robust optimization with objective uncertainty 211
An Approximation Scheme for Two-Stage, Two- Dimensional Knapsack 210
Exact Algorithms for the Two-Dimensional Guillotine Knapsack 210
Packing into the smallest square: Worst-case analysis of lower bounds 208
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling 208
Two-Dimensional Bin Packing Problems 205
A Fast Heuristic for Airport Ground-Service Equipment-and-Staff Allocation 198
Intersection cuts for Bilevel optimization 197
Thinning out Steiner trees: a node-based model for uniform edge costs 197
Backdoor Branching 196
A Heuristic Algorithm for Trip Aggregation in Vehicle Routing Applications 195
Lower and upper bounds for the non-linear generalized assignment problem 195
Efficient two-dimensional data allocation in IEEE 802.16 OFDMA 193
Branching on nonchimerical fractionalities 192
Vattenfall Optimizes Offshore Wind Farm Design 192
Lower bounds and heuristic algorithms for the $k_i$-Partitioning problem 191
In search of dense subgraphs: How good is greedy peeling? 191
Efficient two-dimensional packing algorithms for mobile WiMAX 186
Optimal Turbine Allocation for Offshore and Onshore Wind Farms 183
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem 182
Cutting plane versus compact formulations for uncertain (integer) linear programs 182
Exact solution of the robust knapsack problem 181
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows 181
Requirements for integrated planning of multi-energy systems 180
High-resolution Catheters for Arrhythmic Driver Detection: Preliminary Results in Atrial Fibrillation 179
Adjustable Robust Optimization with Discrete Uncertainty 179
The assignment and loading transportation problem 178
Backdoor Branching 176
Three ideas for the Quadratic Assignment Problem 175
How tight is the corner relaxation? 174
Models and algorithms for packing rectangles into the smallest square 172
Interdiction Games and Monotonicity, with Application to Knapsack Problems 172
Application of Primary Network Analysis in Real Water Distribution Systems 165
Light Robustness 165
On the Product Knapsack Problem 162
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems 159
An iterated local search matheuristic approach for the multi-vehicle inventory routing problem 158
On the Robust Knapsack Problem 157
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions 156
Algorithmic approaches to the multiple knapsack assignment problem 152
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation 142
Exact solution techniques for two-dimensional cutting and packing 139
null 137
null 135
null 130
null 129
null 128
null 123
null 123
Exact algorithms for the 0–1 Time-Bomb Knapsack Problem 122
null 118
null 114
null 113
null 111
null 110
An exact method for binary fortification games 110
Generation and Transmission Expansion Planning with Respect to Global Warming Potential 108
An LP Model for the Central Energy System 98
Two-dimensional packing problems: A survey 89
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA 88
Lagrangian Relaxation for the Intermediate Facilities Location Problem 86
An exact approach to the strip-packing problem 72
Proximity search for 0-1 mixed-integer convex programming 68
Models and algorithms for a staff scheduling problem 67
Exploiting erraticism in search 62
An approximation scheme for the two-stage, two-dimensional bin packing problem 56
Integer linear programming models for 2-staged two-dimensional Knapsack problems 55
Mixed-integer linear programming heuristics for the prepack optimization problem 51
Self-splitting of Workload in Parallel Computation 49
Exact approaches for the knapsack problem with setups 49
Totale 18.288
Categoria #
all - tutte 46.543
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 46.543


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20223.580 0 69 437 402 462 357 398 395 411 112 298 239
2022/20231.565 129 306 83 167 147 105 70 79 280 38 100 61
2023/2024560 32 84 24 27 34 72 33 92 26 69 26 41
2024/20252.751 89 245 247 133 706 156 353 135 55 101 114 417
2025/20265.338 416 442 568 482 513 245 526 323 895 414 284 230
2026/2027450 211 239 0 0 0 0 0 0 0 0 0 0
Totale 18.533