MONACI, MICHELE
 Distribuzione geografica
Continente #
NA - Nord America 6.060
EU - Europa 2.532
AS - Asia 867
AF - Africa 334
SA - Sud America 16
OC - Oceania 4
Totale 9.813
Nazione #
US - Stati Uniti d'America 6.052
GB - Regno Unito 671
IT - Italia 553
DE - Germania 350
CN - Cina 339
VN - Vietnam 238
SE - Svezia 172
TG - Togo 153
FR - Francia 136
IN - India 126
UA - Ucraina 115
IE - Irlanda 101
RU - Federazione Russa 91
CI - Costa d'Avorio 85
SG - Singapore 77
HR - Croazia 70
ZA - Sudafrica 59
EE - Estonia 58
AT - Austria 38
BG - Bulgaria 28
FI - Finlandia 27
NG - Nigeria 23
PL - Polonia 23
CH - Svizzera 22
JO - Giordania 22
NL - Olanda 19
BE - Belgio 15
JP - Giappone 14
HK - Hong Kong 12
SC - Seychelles 11
GR - Grecia 10
RS - Serbia 10
BR - Brasile 9
CA - Canada 8
SI - Slovenia 7
TR - Turchia 7
PK - Pakistan 5
CL - Cile 4
IR - Iran 4
AU - Australia 3
DK - Danimarca 3
IL - Israele 3
LB - Libano 3
PH - Filippine 3
PT - Portogallo 3
SA - Arabia Saudita 3
UZ - Uzbekistan 3
AR - Argentina 2
CZ - Repubblica Ceca 2
ID - Indonesia 2
KR - Corea 2
RO - Romania 2
TW - Taiwan 2
BA - Bosnia-Erzegovina 1
EC - Ecuador 1
EG - Egitto 1
ET - Etiopia 1
HU - Ungheria 1
IS - Islanda 1
LI - Liechtenstein 1
MD - Moldavia 1
MU - Mauritius 1
MY - Malesia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
SK - Slovacchia (Repubblica Slovacca) 1
Totale 9.813
Città #
Ann Arbor 2.525
Fairfield 626
Southend 584
Ashburn 338
Wilmington 331
Woodbridge 288
Seattle 263
Chandler 227
Cambridge 221
Houston 221
Lomé 153
Princeton 152
Bologna 132
Dong Ket 116
Dublin 101
Abidjan 85
Jacksonville 75
Nanjing 68
Westminster 66
Padova 60
Singapore 56
Berlin 55
Rome 42
Jinan 41
Saint Petersburg 36
San Diego 36
Boardman 32
Turin 29
Beijing 28
Sofia 28
Hebei 27
Shenyang 26
Helsinki 24
Abeokuta 23
Milan 23
Amman 22
Vienna 22
Medford 17
Paris 17
Bern 16
Brussels 15
Changsha 15
Des Moines 14
London 14
New York 14
Tianjin 14
Jiaxing 13
Nanchang 13
Taiyuan 13
Mülheim 12
Norwalk 12
Karlsruhe 11
Leeds 11
Hangzhou 10
Mahé 10
Redwood City 10
Falls Church 9
Haikou 9
Taizhou 9
Tappahannock 9
Los Angeles 8
Ningbo 8
Olalla 8
Redmond 8
Shanghai 8
Parma 7
Tokyo 7
Bremen 6
Chicago 6
Kielczow 6
Blue Bell 5
Fuzhou 5
Groningen 5
Harrow 5
Istanbul 5
Lanzhou 5
Naples 5
San Francisco 5
Serra 5
Venice 5
Verona 5
Villeneuve 5
Albignasego 4
Bagnolet 4
Castellarano 4
Dearborn 4
Eisenstadt 4
Frankfurt am Main 4
Guangzhou 4
Hung Hom 4
Ithaca 4
North Richland Hills 4
Nuremberg 4
Plauen 4
Vicenza 4
Warsaw 4
Washington 4
Bastia 3
Bo 3
Bollate 3
Totale 7.670
Nome #
Energy-Efficient Train Control: A Practical Application 216
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 213
Two-dimensional Bin Packing Problems 192
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem 188
Algorithms for packing and scheduling problems 180
A Set-Covering Based Heuristic Approach for Bin-Packing Problems 175
An exact approach for the Vertex Coloring Problem 175
Integer optimization with penalized fractional values: The Knapsack case 173
On the 2-Dimensional Knapsack Problem 172
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem 165
Passenger Railway Optimization 161
A Fast and Efficient Algorithm to Exploit Multi-user Diversity in IEEE 802.16 BandAMC 159
A Metaheuristic Approach for the Vertex Coloring Problem 159
Least cost influence propagation in (social) networks 159
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs 158
Bidimensional Packing by Bilinear Programming 151
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing 149
A dynamic reformulation heuristic for Generalized Interdiction Problems 148
Models and Heuristic Algorithms for a Weighted Vertex Coloring Problem 147
A Heuristic Algorithm for Trip Aggregation in Vehicle Routing Applications 146
Complexity and approximation of an area packing problem 145
Bidimensional packing by bilinear programming 144
Models and algorithms for integrated production and distribution problems 143
An Approximation Scheme for Two-Stage, Two- Dimensional Knapsack 142
Branching on nonchimerical fractionalities 142
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming 142
On the use of intersection cuts for bilevel optimization 141
Packing into the smallest square: Worst-case analysis of lower bounds 138
Backdoor Branching 138
null 137
SelfSplit parallelization for mixed-integer linear programming 136
null 135
Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling 134
Efficient two-dimensional data allocation in IEEE 802.16 OFDMA 134
Two-Dimensional Bin Packing Problems 133
Intersection cuts for Bilevel optimization 133
Exact Algorithms for the Two-Dimensional Guillotine Knapsack 133
Lower bounds and heuristic algorithms for the $k_i$-Partitioning problem 132
null 130
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling 130
null 129
Thinning out Steiner trees: a node-based model for uniform edge costs 129
Interdiction Games and Monotonicity, with Application to Knapsack Problems 129
Cutting plane versus compact formulations for uncertain (integer) linear programs 128
null 128
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows 127
A Fast Heuristic for Airport Ground-Service Equipment-and-Staff Allocation 125
Backdoor Branching 124
null 123
Efficient two-dimensional packing algorithms for mobile WiMAX 123
null 123
Optimal Turbine Allocation for Offshore and Onshore Wind Farms 122
null 118
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem 116
Models and algorithms for packing rectangles into the smallest square 116
On the Product Knapsack Problem 115
Lower and upper bounds for the non-linear generalized assignment problem 115
null 114
Minimum tiling of a rectangle by squares 114
Three ideas for the Quadratic Assignment Problem 113
null 113
Exact solution of the robust knapsack problem 111
null 111
null 110
Requirements for integrated planning of multi-energy systems 109
How tight is the corner relaxation? 106
High-resolution Catheters for Arrhythmic Driver Detection: Preliminary Results in Atrial Fibrillation 103
K-adaptability in stochastic optimization 98
Light Robustness 96
On the Robust Knapsack Problem 95
Vattenfall Optimizes Offshore Wind Farm Design 89
In search of dense subgraphs: How good is greedy peeling? 85
Exact solution techniques for two-dimensional cutting and packing 45
The assignment and loading transportation problem 42
2DPackLib: a two-dimensional cutting and packing library 42
Algorithmic approaches to the multiple knapsack assignment problem 25
Generation and Transmission Expansion Planning with Respect to Global Warming Potential 20
Exact algorithms for the 0–1 Time-Bomb Knapsack Problem 18
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems 16
An LP Model for the Central Energy System 14
An exact approach to the strip-packing problem 14
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions 14
Adjustable Robust Optimization with Discrete Uncertainty 12
Adjustable robust optimization with objective uncertainty 10
An exact method for binary fortification games 9
An approximation scheme for the two-stage, two-dimensional bin packing problem 8
Two-dimensional packing problems: A survey 3
Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints 2
Models and algorithms for a staff scheduling problem 2
Integer linear programming models for 2-staged two-dimensional Knapsack problems 2
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA 1
Mixed-integer linear programming heuristics for the prepack optimization problem 1
Totale 10.085
Categoria #
all - tutte 22.651
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 22.651


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.894 0 50 13 100 234 235 282 296 309 135 121 119
2020/20211.254 261 78 57 51 20 123 23 72 186 60 58 265
2021/20223.830 250 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/202591 89 2 0 0 0 0 0 0 0 0 0 0
Totale 10.085