CERULLI, Raffaele
 Distribuzione geografica
Continente #
AS - Asia 16.064
NA - Nord America 4.509
EU - Europa 1.671
SA - Sud America 273
AF - Africa 37
OC - Oceania 5
Continente sconosciuto - Info sul continente non disponibili 2
Totale 22.561
Nazione #
HK - Hong Kong 14.767
US - Stati Uniti d'America 4.450
IT - Italia 596
CN - Cina 472
SG - Singapore 376
RU - Federazione Russa 286
BR - Brasile 238
UA - Ucraina 230
VN - Vietnam 158
DE - Germania 141
IE - Irlanda 109
TR - Turchia 108
SE - Svezia 71
FI - Finlandia 66
KR - Corea 62
GB - Regno Unito 44
CA - Canada 39
FR - Francia 29
IN - India 28
NL - Olanda 20
PK - Pakistan 16
TN - Tunisia 15
ES - Italia 14
BD - Bangladesh 13
LU - Lussemburgo 12
JP - Giappone 11
MX - Messico 11
PL - Polonia 10
AT - Austria 9
EC - Ecuador 9
ZA - Sudafrica 9
IQ - Iraq 8
IL - Israele 7
PH - Filippine 7
AR - Argentina 6
CL - Cile 6
BE - Belgio 5
EE - Estonia 5
PE - Perù 5
AE - Emirati Arabi Uniti 4
GR - Grecia 4
LT - Lituania 4
NP - Nepal 4
AU - Australia 3
CZ - Repubblica Ceca 3
DZ - Algeria 3
EG - Egitto 3
IR - Iran 3
JM - Giamaica 3
MY - Malesia 3
SA - Arabia Saudita 3
TH - Thailandia 3
UY - Uruguay 3
CO - Colombia 2
DO - Repubblica Dominicana 2
EU - Europa 2
HR - Croazia 2
JO - Giordania 2
PT - Portogallo 2
TW - Taiwan 2
UZ - Uzbekistan 2
VE - Venezuela 2
AF - Afghanistan, Repubblica islamica di 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
BO - Bolivia 1
BZ - Belize 1
CH - Svizzera 1
CI - Costa d'Avorio 1
CV - Capo Verde 1
CY - Cipro 1
HN - Honduras 1
ID - Indonesia 1
IM - Isola di Man 1
KZ - Kazakistan 1
MA - Marocco 1
MD - Moldavia 1
NI - Nicaragua 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
PS - Palestinian Territory 1
PY - Paraguay 1
RO - Romania 1
RS - Serbia 1
SD - Sudan 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
TT - Trinidad e Tobago 1
TV - Tuvalu 1
ZM - Zambia 1
ZW - Zimbabwe 1
Totale 22.561
Città #
Hong Kong 14.760
Ann Arbor 989
Chandler 453
Woodbridge 447
Jacksonville 306
Princeton 304
Houston 275
Wilmington 258
Dallas 220
Singapore 213
Ashburn 138
Dong Ket 133
Dublin 108
Salerno 101
Izmir 96
Beijing 91
Nanjing 74
Andover 68
Pellezzano 52
Moscow 46
Boardman 40
Munich 39
Arbus 33
Shenyang 30
Fairfield 27
Los Angeles 26
São Paulo 26
Changsha 25
New York 24
Fisciano 23
The Dalles 23
Düsseldorf 21
Jiaxing 20
Naples 20
Mestre 19
Nanchang 19
Rome 19
Columbus 18
Hebei 18
Santa Clara 18
Turku 18
Milan 16
Sarno 16
Norwalk 15
Redwood City 15
Tianjin 15
Council Bluffs 14
Jinan 13
Ottawa 13
Esch-sur-Alzette 12
Ho Chi Minh City 11
San Diego 11
Brooklyn 10
Lahore 10
Manchester 10
San Francisco 10
Tokyo 10
Washington 10
Nuremberg 9
Dearborn 8
Indiana 8
Phoenix 8
Warsaw 8
Arzano 7
Bologna 7
Chennai 7
Denver 7
Seattle 7
Atlanta 6
Cambridge 6
Chicago 6
Edinburgh 6
Guangzhou 6
Johannesburg 6
Lappeenranta 6
New Delhi 6
Pune 6
Rio de Janeiro 6
Shanghai 6
Taizhou 6
Toronto 6
Boston 5
Campinas 5
Campo Grande 5
Casaluce 5
Caserta 5
Haikou 5
London 5
Porto Alegre 5
Zhengzhou 5
Amsterdam 4
Atripalda 4
Avellino 4
Battipaglia 4
Brussels 4
Campagna 4
Cava De' Tirreni 4
Dhaka 4
Falls Church 4
Hanoi 4
Totale 20.088
Nome #
The Auction technique for the sensor based navigation planning of an autonomous robot 922
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows 892
Graph Collapsing in Shortest Path Auction Algoritms 886
Maximum flow problems and an np-complete variant on edge-labeled graphs 846
An Optimization Mathematical Model and an Exact Algorithm for the Sensor Location Problem.Presentato al convegno Euro Working Group on Locational Analysis - EWGLA 2010, 28-30 Aprile 2010, Napoli. 776
Extensions of the Minimum Labelling Spanning Tree Problem 769
Improving patient’s medical history classification using a feature construction approach based on situation awareness and granular computing 709
Maximizing Lifetime and Handling Reliability in Wireless Sensor Networks Using Adjustable Sensing Ranges 658
Exact and Heuristic Methods to Maximize Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges 599
The maximum labeled clique problem 559
On the Forward Shortest Path Tour Problem 547
Carousel greedy: A generalized greedy algorithm with applications in optimization 506
A novel discretization scheme for the close enough traveling salesman problem 481
Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations 479
On the complexity of rainbow spanning forest problem 459
A Tabu Search Approach for the Circle Packing Problem 451
The monochromatic set partitioning problem.Presentato al convegno Airo 2010, 07-10 Settembre 2010, Villa San Giovanni (RC). 442
Maximizing lifetime in wireless sensor networks with multiple sensor families 439
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 379
A genetic approach for the 2-edge-connected minimum branch vertices problem 356
A multiplier adjustment technique for the concentrator location problem 345
An evolutionary approach for the offsetting inventory cycle problem 340
Complexity and experimental evaluation of primal-dual Shortest Path Tree algorithms 332
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints 315
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis 307
The Set Orienteering Problem 299
Comparison of heuristics for the colourful travelling salesman problem 295
An exact approach for the grocery delivery problem in urban areas 295
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP 279
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs 259
A new formulation and a branch-and-cut algorithm for the set orienteering problem 241
Lower and upper bounds for the spanning tree with minimum branch vertices 237
Prolonging lifetime in wireless sensor networks with interference constraints 231
Bounded-degree spanning tree problems: models and new algorithms 216
Optimization of a Multiproduct Lignocellulosic Biorefinery using a MILP Approximation 196
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading 195
Locating sensors to observe network arc flows: Exact and heuristic approaches 195
Minimum Weighted Feedback Vertex Set on Diamonds 193
Shortest paths in randomly time varyig networks 177
Efficient preflow push algorithms 176
Exact approaches for the orderly colored longest path problem: performance comparison 171
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem 170
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem 167
The rainbow spanning forest problem 157
The k-labeled Spanning Forest Problem 154
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks 151
A Mathematical Programming Approach for the Maximum Labeled Clique Problem 148
Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage 147
Application-motivated Nonlinear Programming 146
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 143
Relations, models and a memetic approach for three degree-dependent spanning tree problems 136
An efficient and simple approach to solve a distribution problem 133
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem 132
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds 130
An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation 129
The Labeled Maximum Matching Problem 127
A Dual Ascent Approach to the Bounded-Degree Spanning Tree Problem 121
The optimal value range problem for the Interval (immune)Transportation Problem 120
Source Reconstruction of Atmospheric Releases with Limited Meteorological Observations Using Genetic Algorithms 114
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints 113
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks 110
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints 107
Vehicle Routing Problem in Optimal Warehouse Management for FlexibleManufacturing Plants 106
Finding Pattern Configurations for Bank Cheque Printing 104
Best and Worst Values of the Optimal Cost of the Interval Transportation Problem 104
Heuristic Approaches for the Minimum Labelling Hamiltonian Cycle Problem 101
Process Pathways Optimization for a Lignocellulosic Biorefinery Producing Levulinic Acid, Succinic Acid, and Ethanol 100
Vehicle-ID sensor location for route flow recognition: Models and algorithms 100
A biased random-key genetic algorithm for the knapsack problem with forfeit sets 98
Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution NetworksSmart City 98
Contrasting the spread of misinformation in online social networks 98
Shortest path auction algorithm without contractions using virtual source concept 97
The Rainbow Cycle Cover Problem 92
Rendezvous of mobile robots in unknown environment via graph optimization approach 91
A new forward backward Auction algorithm 90
The knapsack problem with forfeits 90
An improved heuristic approach for the interval immune transportation problem 85
Maximum Network Lifetime Problem with Time Slots and coverage constraints: heuristic approaches 83
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints 80
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem 80
The Budgeted Labeled Minimum Spanning Tree Problem 77
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms 75
OMEGA one multi ethnic genetic approach 74
Grocery distribution plans in urban networks with street crossing penalties 68
Shortest paths with exclusive-disjunction arc pairs conflicts 67
A reduction heuristic for the all-colors shortest path problem 67
Maximizing lifetime and handling reliability in wireless sensor networks 64
Metaheuristics comparison for the minimum labelling spanning tree problem 63
Preface: Theoretical and algorithmic contributions to network optimization problems 63
A Flow Formulation for the Close-Enough Arc Routing Problem 60
A two-level metaheuristic for the all colors shortest path problem 58
Models, algorithms and applications for location problems 55
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem 53
Operations management in distribution networks within a smart city framework 42
A Service Oriented Architecture for Clinical Decision Support Systems Based on Artificial Intelligence 26
Quantifying Outcome Functions of Linear Programs: An Approach Based on Interval-Valued Right-Hand Sides 26
Totale 22.939
Categoria #
all - tutte 48.232
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 48.232


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021517 0 0 0 16 73 33 69 5 76 10 72 163
2021/2022641 7 4 8 7 30 25 11 21 85 69 128 246
2022/2023978 98 121 21 140 84 188 2 98 155 8 43 20
2023/2024439 33 95 50 21 35 61 11 20 11 14 16 72
2024/20251.498 43 55 16 45 75 141 280 103 163 102 175 300
2025/202615.393 3.513 7.248 4.493 139 0 0 0 0 0 0 0 0
Totale 22.939