UniSa - IRIS Institutional Research Information System

CERULLI, Raffaele
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.128
EU - Europa 1.585
AS - Asia 1.303
SA - Sud America 190
AF - Africa 29
OC - Oceania 4
Continente sconosciuto - Info sul continente non disponibili 2
Totale 7.241
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.096
IT - Italia 568
CN - Cina 402
SG - Singapore 320
RU - Federazione Russa 286
UA - Ucraina 229
HK - Hong Kong 196
BR - Brasile 170
VN - Vietnam 137
DE - Germania 135
IE - Irlanda 109
TR - Turchia 105
SE - Svezia 70
FI - Finlandia 62
KR - Corea 59
GB - Regno Unito 38
FR - Francia 29
CA - Canada 24
IN - India 21
NL - Olanda 20
PK - Pakistan 15
TN - Tunisia 15
ES - Italia 7
ZA - Sudafrica 7
AR - Argentina 6
AT - Austria 6
IQ - Iraq 6
PH - Filippine 6
BD - Bangladesh 5
EC - Ecuador 5
EE - Estonia 5
MX - Messico 5
GR - Grecia 4
IL - Israele 4
NP - Nepal 4
AU - Australia 3
BE - Belgio 3
CL - Cile 3
CZ - Repubblica Ceca 3
DZ - Algeria 3
IR - Iran 3
JP - Giappone 3
PL - Polonia 3
SA - Arabia Saudita 3
TH - Thailandia 3
AE - Emirati Arabi Uniti 2
EG - Egitto 2
EU - Europa 2
HR - Croazia 2
JM - Giamaica 2
MY - Malesia 2
TW - Taiwan 2
UY - Uruguay 2
UZ - Uzbekistan 2
VE - Venezuela 2
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
CH - Svizzera 1
CO - Colombia 1
CY - Cipro 1
IM - Isola di Man 1
JO - Giordania 1
LT - Lituania 1
MA - Marocco 1
NI - Nicaragua 1
NZ - Nuova Zelanda 1
PS - Palestinian Territory 1
PY - Paraguay 1
RO - Romania 1
ZM - Zambia 1
Totale 7.241
Salva come PNG Salva come JPEG
Città #
Ann Arbor 989
Chandler 453
Woodbridge 447
Jacksonville 306
Princeton 303
Houston 274
Wilmington 258
Hong Kong 192
Singapore 162
Dong Ket 133
Ashburn 116
Dublin 108
Salerno 100
Izmir 96
Beijing 83
Nanjing 74
Andover 68
Pellezzano 52
Moscow 46
Boardman 40
Munich 34
Arbus 33
Shenyang 30
Dallas 29
Fairfield 27
Changsha 25
The Dalles 22
Düsseldorf 21
Jiaxing 20
Fisciano 19
Mestre 19
Nanchang 19
Columbus 18
Hebei 18
Rome 18
Turku 17
Sarno 16
Naples 15
Norwalk 15
Redwood City 15
Tianjin 15
Los Angeles 14
Milan 14
São Paulo 14
Jinan 13
New York 13
Ottawa 13
Council Bluffs 12
San Diego 11
Santa Clara 11
Lahore 10
Washington 10
Manchester 9
Nuremberg 9
Dearborn 8
Indiana 8
San Francisco 8
Arzano 7
Cambridge 6
Edinburgh 6
Taizhou 6
Brooklyn 5
Casaluce 5
Caserta 5
Guangzhou 5
Haikou 5
New Delhi 5
Porto Alegre 5
Pune 5
Seattle 5
Shanghai 5
Zhengzhou 5
Amsterdam 4
Atripalda 4
Battipaglia 4
Campagna 4
Cava De' Tirreni 4
Chennai 4
Chicago 4
Falls Church 4
Johannesburg 4
London 4
Marigliano 4
McLean 4
Meppel 4
Ningbo 4
Ptolemaida 4
Rio de Janeiro 4
San Marzano sul Sarno 4
Stillwater 4
Taiyuan 4
Toulouse 4
Bari 3
Belém 3
Besançon 3
Boston 3
Brasília 3
Brescia 3
Campinas 3
Campo Grande 3
Totale 5.106
Salva come PNG Salva come JPEG
Nome #
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. 293
Optimization of a Multiproduct Lignocellulosic Biorefinery using a MILP Approximation 186
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks 140
Lower and upper bounds for the spanning tree with minimum branch vertices 139
Application-motivated Nonlinear Programming 134
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading 132
The rainbow spanning forest problem 131
Relations, models and a memetic approach for three degree-dependent spanning tree problems 127
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 126
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem 119
Comparison of heuristics for the colourful travelling salesman problem 118
Bounded-degree spanning tree problems: models and new algorithms 117
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds 117
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem 116
The Auction technique for the sensor based navigation planning of an autonomous robot 115
On the Forward Shortest Path Tour Problem 112
A Mathematical Programming Approach for the Maximum Labeled Clique Problem 111
A Dual Ascent Approach to the Bounded-Degree Spanning Tree Problem 108
Extensions of the Minimum Labelling Spanning Tree Problem 106
Exact and Heuristic Methods to Maximize Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges 106
Locating sensors to observe network arc flows: Exact and heuristic approaches 106
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints 104
Maximizing lifetime in wireless sensor networks with multiple sensor families 102
A Tabu Search Approach for the Circle Packing Problem 102
A multiplier adjustment technique for the concentrator location problem 100
An exact approach for the grocery delivery problem in urban areas 100
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem 99
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks 98
Source Reconstruction of Atmospheric Releases with Limited Meteorological Observations Using Genetic Algorithms 98
A novel discretization scheme for the close enough traveling salesman problem 97
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints 96
Finding Pattern Configurations for Bank Cheque Printing 93
Shortest paths in randomly time varyig networks 92
Vehicle-ID sensor location for route flow recognition: Models and algorithms 90
Shortest path auction algorithm without contractions using virtual source concept 89
The Labeled Maximum Matching Problem 89
Minimum Weighted Feedback Vertex Set on Diamonds 88
Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution NetworksSmart City 87
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints 85
Best and Worst Values of the Optimal Cost of the Interval Transportation Problem 85
Maximizing Lifetime and Handling Reliability in Wireless Sensor Networks Using Adjustable Sensing Ranges 83
The Rainbow Cycle Cover Problem 83
Rendezvous of mobile robots in unknown environment via graph optimization approach 82
Vehicle Routing Problem in Optimal Warehouse Management for FlexibleManufacturing Plants 82
On the complexity of rainbow spanning forest problem 81
Efficient preflow push algorithms 80
Heuristic Approaches for the Minimum Labelling Hamiltonian Cycle Problem 80
A genetic approach for the 2-edge-connected minimum branch vertices problem 79
A new forward backward Auction algorithm 79
The k-labeled Spanning Forest Problem 79
The monochromatic set partitioning problem.Presentato al convegno Airo 2010, 07-10 Settembre 2010, Villa San Giovanni (RC). 76
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows 76
Carousel greedy: A generalized greedy algorithm with applications in optimization 76
Process Pathways Optimization for a Lignocellulosic Biorefinery Producing Levulinic Acid, Succinic Acid, and Ethanol 75
The Set Orienteering Problem 75
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis 73
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem 70
The knapsack problem with forfeits 70
An evolutionary approach for the offsetting inventory cycle problem 69
Graph Collapsing in Shortest Path Auction Algoritms 68
The optimal value range problem for the Interval (immune)Transportation Problem 67
Complexity and experimental evaluation of primal-dual Shortest Path Tree algorithms 66
Prolonging lifetime in wireless sensor networks with interference constraints 65
An improved heuristic approach for the interval immune transportation problem 64
The maximum labeled clique problem 63
OMEGA one multi ethnic genetic approach 63
Metaheuristics comparison for the minimum labelling spanning tree problem 58
Maximum Network Lifetime Problem with Time Slots and coverage constraints: heuristic approaches 58
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms 56
A reduction heuristic for the all-colors shortest path problem 56
Exact approaches for the orderly colored longest path problem: performance comparison 54
Maximizing lifetime and handling reliability in wireless sensor networks 53
Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations 52
Contrasting the spread of misinformation in online social networks 50
Models, algorithms and applications for location problems 49
A Flow Formulation for the Close-Enough Arc Routing Problem 49
Preface: Theoretical and algorithmic contributions to network optimization problems 49
A two-level metaheuristic for the all colors shortest path problem 49
An efficient and simple approach to solve a distribution problem 48
Shortest paths with exclusive-disjunction arc pairs conflicts 45
Maximum flow problems and an np-complete variant on edge-labeled graphs 45
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 43
An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation 38
Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage 37
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem 35
A new formulation and a branch-and-cut algorithm for the set orienteering problem 32
Grocery distribution plans in urban networks with street crossing penalties 32
Operations management in distribution networks within a smart city framework 28
The Budgeted Labeled Minimum Spanning Tree Problem 23
Improving patient’s medical history classification using a feature construction approach based on situation awareness and granular computing 21
A biased random-key genetic algorithm for the knapsack problem with forfeit sets 20
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP 16
A Service Oriented Architecture for Clinical Decision Support Systems Based on Artificial Intelligence 13
Quantifying Outcome Functions of Linear Programs: An Approach Based on Interval-Valued Right-Hand Sides 12
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs 11
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints 9
Totale 7.618
Salva come PNG Salva come JPEG
Categoria #
all - tutte 27.539
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.539
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021613 3 47 46 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/202672 72 0 0 0 0 0 0 0 0 0 0 0
Totale 7.618