CRIS Current Research Information System

MONACI, MICHELE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.515
EU - Europa 2.767
AS - Asia 1.854
AF - Africa 335
SA - Sud America 35
OC - Oceania 5
Totale 11.511
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.505
SG - Singapore 719
IT - Italia 698
GB - Regno Unito 678
CN - Cina 627
DE - Germania 362
VN - Vietnam 239
SE - Svezia 172
TG - Togo 153
FR - Francia 146
IN - India 129
UA - Ucraina 115
IE - Irlanda 104
RU - Federazione Russa 102
CI - Costa d'Avorio 85
HR - Croazia 70
ZA - Sudafrica 60
EE - Estonia 59
AT - Austria 46
FI - Finlandia 45
HK - Hong Kong 36
NL - Olanda 30
BG - Bulgaria 28
CH - Svizzera 27
BR - Brasile 25
NG - Nigeria 23
PL - Polonia 23
JO - Giordania 22
ID - Indonesia 20
JP - Giappone 20
BE - Belgio 15
SC - Seychelles 11
GR - Grecia 10
RS - Serbia 10
TR - Turchia 9
CA - Canada 8
SI - Slovenia 7
CL - Cile 5
PK - Pakistan 5
AR - Argentina 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
BD - Bangladesh 2
CZ - Repubblica Ceca 2
ES - Italia 2
KR - Corea 2
NZ - Nuova Zelanda 2
RO - Romania 2
TW - Taiwan 2
AL - Albania 1
BA - Bosnia-Erzegovina 1
CR - Costa Rica 1
EC - Ecuador 1
EG - Egitto 1
ET - Etiopia 1
HU - Ungheria 1
IS - Islanda 1
KH - Cambogia 1
LI - Liechtenstein 1
LV - Lettonia 1
MD - Moldavia 1
MU - Mauritius 1
MX - Messico 1
MY - Malesia 1
NP - Nepal 1
SK - Slovacchia (Repubblica Slovacca) 1
Totale 11.511
Salva come PNG Salva come JPEG
Città #
Ann Arbor 2.525
Fairfield 626
Southend 584
Singapore 349
Ashburn 344
Wilmington 331
Woodbridge 288
Seattle 264
Santa Clara 240
Chandler 227
Cambridge 221
Houston 221
Bologna 180
Lomé 153
Princeton 152
Boardman 123
Dong Ket 116
Dublin 104
Abidjan 85
Jacksonville 75
Nanjing 69
Padova 67
Westminster 66
Berlin 55
Jinan 46
Rome 46
Beijing 38
Helsinki 37
Milan 36
Saint Petersburg 36
San Diego 36
Shanghai 29
Turin 29
Shenyang 28
Sofia 28
Vienna 28
Hebei 27
Hong Kong 25
Abeokuta 23
Amman 22
Paris 19
Changsha 18
Guangzhou 18
Jakarta 18
Tianjin 18
Medford 17
Bern 16
Brussels 15
Des Moines 14
Jiaxing 14
London 14
Nanchang 14
New York 14
Casalecchio di Reno 13
Taiyuan 13
Tokyo 13
Vicenza 13
Hangzhou 12
Mülheim 12
Norwalk 12
Karlsruhe 11
Leeds 11
Zhengzhou 11
Los Angeles 10
Mahé 10
Redwood City 10
Shenzhen 10
Falls Church 9
Fuzhou 9
Haikou 9
Ningbo 9
Taizhou 9
Tappahannock 9
Olalla 8
Redmond 8
Chicago 7
Istanbul 7
Naples 7
Parma 7
Amsterdam 6
Bremen 6
Chengdu 6
Kielczow 6
Nuremberg 6
Phoenix 6
Blue Bell 5
Council Bluffs 5
Dongguan 5
Foshan 5
Groningen 5
Harrow 5
Lanzhou 5
Muri bei Bern 5
North Bergen 5
Offenbach 5
San Francisco 5
Serra 5
Venice 5
Verona 5
Villeneuve 5
Totale 8.558
Salva come PNG Salva come JPEG
Nome #
Energy-Efficient Train Control: A Practical Application 238
Two-dimensional Bin Packing Problems 227
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 225
Algorithms for packing and scheduling problems 204
Integer optimization with penalized fractional values: The Knapsack case 201
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem 200
A Set-Covering Based Heuristic Approach for Bin-Packing Problems 194
An exact approach for the Vertex Coloring Problem 192
On the 2-Dimensional Knapsack Problem 186
Least cost influence propagation in (social) networks 183
A Metaheuristic Approach for the Vertex Coloring Problem 182
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs 182
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming 179
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem 178
Passenger Railway Optimization 176
A Fast and Efficient Algorithm to Exploit Multi-user Diversity in IEEE 802.16 BandAMC 175
Models and algorithms for integrated production and distribution problems 175
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing 170
A dynamic reformulation heuristic for Generalized Interdiction Problems 168
Bidimensional Packing by Bilinear Programming 167
Models and Heuristic Algorithms for a Weighted Vertex Coloring Problem 166
On the use of intersection cuts for bilevel optimization 166
An Approximation Scheme for Two-Stage, Two- Dimensional Knapsack 159
A Heuristic Algorithm for Trip Aggregation in Vehicle Routing Applications 159
Backdoor Branching 158
Bidimensional packing by bilinear programming 158
Complexity and approximation of an area packing problem 157
Branching on nonchimerical fractionalities 155
SelfSplit parallelization for mixed-integer linear programming 155
Packing into the smallest square: Worst-case analysis of lower bounds 154
Two-Dimensional Bin Packing Problems 153
Exact Algorithms for the Two-Dimensional Guillotine Knapsack 153
Thinning out Steiner trees: a node-based model for uniform edge costs 152
Lower bounds and heuristic algorithms for the $k_i$-Partitioning problem 151
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling 150
Efficient two-dimensional data allocation in IEEE 802.16 OFDMA 149
Intersection cuts for Bilevel optimization 148
Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling 146
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows 145
Optimal Turbine Allocation for Offshore and Onshore Wind Farms 144
Cutting plane versus compact formulations for uncertain (integer) linear programs 142
Efficient two-dimensional packing algorithms for mobile WiMAX 140
Interdiction Games and Monotonicity, with Application to Knapsack Problems 139
A Fast Heuristic for Airport Ground-Service Equipment-and-Staff Allocation 138
null 137
Exact solution of the robust knapsack problem 136
Three ideas for the Quadratic Assignment Problem 135
null 135
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem 134
Backdoor Branching 134
Lower and upper bounds for the non-linear generalized assignment problem 133
null 130
null 129
Models and algorithms for packing rectangles into the smallest square 129
null 128
How tight is the corner relaxation? 127
Minimum tiling of a rectangle by squares 127
On the Product Knapsack Problem 126
Requirements for integrated planning of multi-energy systems 124
High-resolution Catheters for Arrhythmic Driver Detection: Preliminary Results in Atrial Fibrillation 124
null 123
null 123
null 118
K-adaptability in stochastic optimization 118
Light Robustness 117
null 114
null 113
On the Robust Knapsack Problem 111
null 111
null 110
Vattenfall Optimizes Offshore Wind Farm Design 106
In search of dense subgraphs: How good is greedy peeling? 105
On-line strategy selection for reducing overcrowding in an Emergency Department 78
2DPackLib: a two-dimensional cutting and packing library 59
Exact solution techniques for two-dimensional cutting and packing 58
The assignment and loading transportation problem 53
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems 51
Algorithmic approaches to the multiple knapsack assignment problem 48
Adjustable Robust Optimization with Discrete Uncertainty 43
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions 41
Adjustable robust optimization with objective uncertainty 40
Exact algorithms for the 0–1 Time-Bomb Knapsack Problem 40
An exact method for binary fortification games 37
Generation and Transmission Expansion Planning with Respect to Global Warming Potential 35
An LP Model for the Central Energy System 30
An approximation scheme for the two-stage, two-dimensional bin packing problem 26
An exact approach to the strip-packing problem 23
Two-dimensional packing problems: A survey 21
Self-splitting of Workload in Parallel Computation 19
Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints 17
Application of Primary Network Analysis in Real Water Distribution Systems 17
Exact approaches for the knapsack problem with setups 17
Improving branch-and-cut performance by random sampling 16
Exploiting erraticism in search 16
Models and algorithms for a staff scheduling problem 16
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA 15
Mixed-integer linear programming heuristics for the prepack optimization problem 14
Proximity search for 0-1 mixed-integer convex programming 14
On handling indicator constraints in mixed integer programming 12
Proximity Benders: a decomposition heuristic for stochastic programs 12
Totale 11.764
Salva come PNG Salva come JPEG
Categoria #
all - tutte 27.309
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 27.309
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.262 0 0 0 0 0 0 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/20251.797 89 245 247 133 706 156 221 0 0 0 0 0
Totale 11.791