CERULLI, Raffaele
 Distribuzione geografica
Continente #
AS - Asia 16.660
NA - Nord America 4.771
EU - Europa 1.725
SA - Sud America 332
AF - Africa 43
OC - Oceania 5
Continente sconosciuto - Info sul continente non disponibili 2
Totale 23.538
Nazione #
HK - Hong Kong 14.769
US - Stati Uniti d'America 4.690
SG - Singapore 783
IT - Italia 605
CN - Cina 555
RU - Federazione Russa 287
BR - Brasile 278
UA - Ucraina 230
VN - Vietnam 228
DE - Germania 143
IE - Irlanda 109
TR - Turchia 109
SE - Svezia 76
FI - Finlandia 66
KR - Corea 62
GB - Regno Unito 60
CA - Canada 47
IN - India 36
FR - Francia 30
NL - Olanda 21
MX - Messico 20
ES - Italia 18
JP - Giappone 18
PK - Pakistan 18
PL - Polonia 18
AR - Argentina 16
BD - Bangladesh 16
TN - Tunisia 15
EC - Ecuador 13
LU - Lussemburgo 12
ZA - Sudafrica 10
AT - Austria 9
IQ - Iraq 9
LT - Lituania 9
CL - Cile 8
PH - Filippine 8
IL - Israele 7
DO - Repubblica Dominicana 6
PE - Perù 6
BE - Belgio 5
EE - Estonia 5
UZ - Uzbekistan 5
AE - Emirati Arabi Uniti 4
GR - Grecia 4
ID - Indonesia 4
NP - Nepal 4
UY - Uruguay 4
AU - Australia 3
CZ - Repubblica Ceca 3
DZ - Algeria 3
EG - Egitto 3
IR - Iran 3
JM - Giamaica 3
JO - Giordania 3
KZ - Kazakistan 3
MY - Malesia 3
SA - Arabia Saudita 3
TH - Thailandia 3
VE - Venezuela 3
BG - Bulgaria 2
CO - Colombia 2
EU - Europa 2
HR - Croazia 2
MA - Marocco 2
PT - Portogallo 2
SK - Slovacchia (Repubblica Slovacca) 2
SN - Senegal 2
TW - Taiwan 2
AF - Afghanistan, Repubblica islamica di 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BO - Bolivia 1
BZ - Belize 1
CH - Svizzera 1
CI - Costa d'Avorio 1
CV - Capo Verde 1
CY - Cipro 1
DM - Dominica 1
ET - Etiopia 1
GA - Gabon 1
HN - Honduras 1
IM - Isola di Man 1
KE - Kenya 1
LB - Libano 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
TT - Trinidad e Tobago 1
TV - Tuvalu 1
ZM - Zambia 1
ZW - Zimbabwe 1
Totale 23.538
Città #
Hong Kong 14.762
Ann Arbor 989
Chandler 453
Woodbridge 447
Singapore 440
Jacksonville 306
Princeton 304
Houston 279
Wilmington 258
Dallas 220
Ashburn 190
Dong Ket 133
Beijing 113
Dublin 108
Salerno 101
Izmir 96
Nanjing 74
Andover 68
Pellezzano 52
Moscow 46
New York 44
The Dalles 44
Los Angeles 41
São Paulo 41
Boardman 40
Munich 39
Arbus 33
Ho Chi Minh City 33
Shenyang 30
Fairfield 27
Changsha 25
Naples 24
Fisciano 23
Denver 22
Düsseldorf 21
Jiaxing 20
Santa Clara 20
Hanoi 19
Mestre 19
Nanchang 19
Rome 19
Columbus 18
Hebei 18
Turku 18
Tokyo 17
Milan 16
Sarno 16
Warsaw 16
Norwalk 15
Redwood City 15
Tianjin 15
Council Bluffs 14
Manchester 14
Brooklyn 13
Jinan 13
London 13
Orem 13
Ottawa 13
Chennai 12
Chicago 12
Esch-sur-Alzette 12
Lahore 12
San Diego 11
Nuremberg 10
San Francisco 10
Washington 10
Phoenix 9
San Jose 9
Stockholm 9
Atlanta 8
Dearborn 8
Indiana 8
Montreal 8
Arzano 7
Bologna 7
Boston 7
Da Nang 7
Guangzhou 7
Johannesburg 7
New Delhi 7
Rio de Janeiro 7
Seattle 7
Toronto 7
Cambridge 6
Campinas 6
Edinburgh 6
Lappeenranta 6
Pune 6
Shanghai 6
Taizhou 6
Vilnius 6
Amsterdam 5
Campo Grande 5
Casaluce 5
Caserta 5
Dhaka 5
Haikou 5
Haiphong 5
Mexico City 5
Porto Alegre 5
Totale 20.610
Nome #
The Auction technique for the sensor based navigation planning of an autonomous robot 929
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows 906
Graph Collapsing in Shortest Path Auction Algoritms 892
Maximum flow problems and an np-complete variant on edge-labeled graphs 854
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. 789
Extensions of the Minimum Labelling Spanning Tree Problem 773
Improving patient’s medical history classification using a feature construction approach based on situation awareness and granular computing 727
Maximizing Lifetime and Handling Reliability in Wireless Sensor Networks Using Adjustable Sensing Ranges 672
Exact and Heuristic Methods to Maximize Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges 607
The maximum labeled clique problem 566
On the Forward Shortest Path Tour Problem 557
Carousel greedy: A generalized greedy algorithm with applications in optimization 516
A novel discretization scheme for the close enough traveling salesman problem 494
Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations 486
On the complexity of rainbow spanning forest problem 471
A Tabu Search Approach for the Circle Packing Problem 464
Maximizing lifetime in wireless sensor networks with multiple sensor families 449
The monochromatic set partitioning problem.Presentato al convegno Airo 2010, 07-10 Settembre 2010, Villa San Giovanni (RC). 444
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 386
A genetic approach for the 2-edge-connected minimum branch vertices problem 371
A multiplier adjustment technique for the concentrator location problem 358
An evolutionary approach for the offsetting inventory cycle problem 348
Complexity and experimental evaluation of primal-dual Shortest Path Tree algorithms 339
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints 334
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis 318
The Set Orienteering Problem 311
Comparison of heuristics for the colourful travelling salesman problem 308
An exact approach for the grocery delivery problem in urban areas 300
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP 289
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs 266
A new formulation and a branch-and-cut algorithm for the set orienteering problem 255
Lower and upper bounds for the spanning tree with minimum branch vertices 242
Prolonging lifetime in wireless sensor networks with interference constraints 237
Bounded-degree spanning tree problems: models and new algorithms 227
Optimization of a Multiproduct Lignocellulosic Biorefinery using a MILP Approximation 211
Locating sensors to observe network arc flows: Exact and heuristic approaches 207
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading 206
Minimum Weighted Feedback Vertex Set on Diamonds 199
Shortest paths in randomly time varyig networks 188
Efficient preflow push algorithms 183
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem 180
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem 179
Exact approaches for the orderly colored longest path problem: performance comparison 176
The rainbow spanning forest problem 171
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks 167
Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage 164
A Mathematical Programming Approach for the Maximum Labeled Clique Problem 162
The k-labeled Spanning Forest Problem 160
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 157
Application-motivated Nonlinear Programming 152
Relations, models and a memetic approach for three degree-dependent spanning tree problems 148
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem 147
An efficient and simple approach to solve a distribution problem 146
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds 142
An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation 137
The Labeled Maximum Matching Problem 136
A Dual Ascent Approach to the Bounded-Degree Spanning Tree Problem 134
Source Reconstruction of Atmospheric Releases with Limited Meteorological Observations Using Genetic Algorithms 127
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints 127
The optimal value range problem for the Interval (immune)Transportation Problem 127
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints 122
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks 121
Process Pathways Optimization for a Lignocellulosic Biorefinery Producing Levulinic Acid, Succinic Acid, and Ethanol 117
Heuristic Approaches for the Minimum Labelling Hamiltonian Cycle Problem 116
Contrasting the spread of misinformation in online social networks 115
Vehicle-ID sensor location for route flow recognition: Models and algorithms 113
Best and Worst Values of the Optimal Cost of the Interval Transportation Problem 111
Finding Pattern Configurations for Bank Cheque Printing 110
Vehicle Routing Problem in Optimal Warehouse Management for FlexibleManufacturing Plants 109
A biased random-key genetic algorithm for the knapsack problem with forfeit sets 107
Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution NetworksSmart City 104
Shortest path auction algorithm without contractions using virtual source concept 103
A new forward backward Auction algorithm 101
The knapsack problem with forfeits 101
The Rainbow Cycle Cover Problem 98
An improved heuristic approach for the interval immune transportation problem 97
Rendezvous of mobile robots in unknown environment via graph optimization approach 96
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem 94
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints 92
Maximum Network Lifetime Problem with Time Slots and coverage constraints: heuristic approaches 91
The Budgeted Labeled Minimum Spanning Tree Problem 88
OMEGA one multi ethnic genetic approach 87
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms 83
Maximizing lifetime and handling reliability in wireless sensor networks 79
A reduction heuristic for the all-colors shortest path problem 78
Shortest paths with exclusive-disjunction arc pairs conflicts 76
Grocery distribution plans in urban networks with street crossing penalties 72
A Flow Formulation for the Close-Enough Arc Routing Problem 70
A two-level metaheuristic for the all colors shortest path problem 70
Metaheuristics comparison for the minimum labelling spanning tree problem 68
Preface: Theoretical and algorithmic contributions to network optimization problems 67
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem 60
Models, algorithms and applications for location problems 59
Operations management in distribution networks within a smart city framework 50
A Service Oriented Architecture for Clinical Decision Support Systems Based on Artificial Intelligence 44
Quantifying Outcome Functions of Linear Programs: An Approach Based on Interval-Valued Right-Hand Sides 29
Totale 23.916
Categoria #
all - tutte 50.633
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 50.633


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021428 0 0 0 0 0 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/202616.370 3.513 7.248 4.493 225 705 186 0 0 0 0 0 0
Totale 23.916