UniSa - IRIS Institutional Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020188 0 0 0 0 0 0 0 0 0 0 169 19
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.029 43 55 16 45 75 141 280 103 163 102 6 0
Totale 7.077