UniSa - IRIS Institutional Research Information System

CARRABS, Francesco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 11.984
NA - Nord America 2.979
EU - Europa 1.022
SA - Sud America 228
AF - Africa 26
OC - Oceania 2
Continente sconosciuto - Info sul continente non disponibili 1
Totale 16.242
Salva come PNG Salva come JPEG
Nazione #
HK - Hong Kong 10.598
US - Stati Uniti d'America 2.922
SG - Singapore 531
IT - Italia 346
CN - Cina 328
VN - Vietnam 212
BR - Brasile 177
RU - Federazione Russa 171
UA - Ucraina 103
DE - Germania 90
IE - Irlanda 64
TR - Turchia 63
FR - Francia 60
IN - India 53
SE - Svezia 40
GB - Regno Unito 38
FI - Finlandia 36
KR - Corea 34
CA - Canada 29
BD - Bangladesh 26
IQ - Iraq 25
PK - Pakistan 17
JP - Giappone 15
MX - Messico 15
SA - Arabia Saudita 15
AR - Argentina 13
EC - Ecuador 13
LU - Lussemburgo 12
NL - Olanda 11
ES - Italia 10
PL - Polonia 10
ID - Indonesia 8
MY - Malesia 8
NP - Nepal 8
PH - Filippine 7
AT - Austria 6
CL - Cile 6
TN - Tunisia 6
EG - Egitto 5
LT - Lituania 5
UZ - Uzbekistan 5
VE - Venezuela 5
AE - Emirati Arabi Uniti 4
CO - Colombia 4
GR - Grecia 4
IL - Israele 4
JO - Giordania 4
KZ - Kazakistan 4
OM - Oman 4
PE - Perù 4
ZA - Sudafrica 4
CZ - Repubblica Ceca 3
DO - Repubblica Dominicana 3
JM - Giamaica 3
AO - Angola 2
AZ - Azerbaigian 2
BE - Belgio 2
BG - Bulgaria 2
BO - Bolivia 2
CR - Costa Rica 2
DZ - Algeria 2
HR - Croazia 2
LB - Libano 2
MA - Marocco 2
SN - Senegal 2
TT - Trinidad e Tobago 2
UY - Uruguay 2
AF - Afghanistan, Repubblica islamica di 1
AU - Australia 1
BA - Bosnia-Erzegovina 1
BY - Bielorussia 1
CH - Svizzera 1
CY - Cipro 1
DM - Dominica 1
EE - Estonia 1
ET - Etiopia 1
EU - Europa 1
KE - Kenya 1
KG - Kirghizistan 1
KH - Cambogia 1
MD - Moldavia 1
PA - Panama 1
PR - Porto Rico 1
PS - Palestinian Territory 1
PT - Portogallo 1
PY - Paraguay 1
RS - Serbia 1
SD - Sudan 1
SR - Suriname 1
TH - Thailandia 1
TV - Tuvalu 1
TW - Taiwan 1
Totale 16.242
Salva come PNG Salva come JPEG
Città #
Hong Kong 10.588
Ann Arbor 520
Singapore 324
Woodbridge 313
San Jose 287
Chandler 211
Princeton 169
Ashburn 141
Jacksonville 136
Houston 122
Dallas 114
Wilmington 98
Dong Ket 64
Dublin 64
Beijing 63
Izmir 54
The Dalles 54
Salerno 53
Council Bluffs 52
Lauterbourg 47
Nanjing 46
Hanoi 38
Ho Chi Minh City 37
Andover 34
Los Angeles 31
New York 31
São Paulo 27
Boardman 26
Naples 24
Pellezzano 24
Munich 23
Moscow 18
Sarno 18
Santa Clara 17
Arbus 16
Fairfield 14
Shenyang 14
Tokyo 14
Da Nang 13
Redwood City 13
Changsha 12
Denver 12
Esch-sur-Alzette 12
Haiphong 12
Ottawa 12
Turku 12
Mestre 11
Baghdad 10
Brooklyn 10
Columbus 10
Hebei 10
London 10
Montreal 10
Orem 10
Warsaw 10
Chennai 9
Jiaxing 9
Lahore 9
Düsseldorf 8
Fisciano 8
Jinan 8
Rio de Janeiro 8
Rome 8
Tianjin 8
Arzano 7
Casaluce 7
Jeddah 7
Norwalk 7
Phoenix 7
San Francisco 7
Stockholm 7
Chicago 6
Frankfurt am Main 6
Guangzhou 6
Mumbai 6
Nanchang 6
New Delhi 6
Seattle 6
Shanghai 6
Boston 5
Curitiba 5
Dhaka 5
Hangzhou 5
Indiana 5
Lappeenranta 5
Nuremberg 5
Poplar 5
Amman 4
Amsterdam 4
Ankara 4
Atripalda 4
Avellino 4
Brasília 4
Buffalo 4
Cava De' Tirreni 4
Guayaquil 4
Hải Dương 4
Manchester 4
McLean 4
Milan 4
Totale 14.379
Salva come PNG Salva come JPEG
Nome #
Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints 2.689
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows 934
The maximum labeled clique problem 575
On the Forward Shortest Path Tour Problem 575
A biased random-key genetic algorithm for the set orienteering problem 515
A novel discretization scheme for the close enough traveling salesman problem 513
On the complexity of rainbow spanning forest problem 490
Maximizing lifetime in wireless sensor networks with multiple sensor families 482
A Tabu Search Approach for the Circle Packing Problem 480
The monochromatic set partitioning problem.Presentato al convegno Airo 2010, 07-10 Settembre 2010, Villa San Giovanni (RC). 462
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs 455
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading 449
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 402
A genetic approach for the 2-edge-connected minimum branch vertices problem 401
An evolutionary approach for the offsetting inventory cycle problem 362
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints 357
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis 341
The Set Orienteering Problem 324
An exact approach for the grocery delivery problem in urban areas 315
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP 306
A new formulation and a branch-and-cut algorithm for the set orienteering problem 284
Lower and upper bounds for the spanning tree with minimum branch vertices 264
Prolonging lifetime in wireless sensor networks with interference constraints 255
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading 222
Minimum Weighted Feedback Vertex Set on Diamonds 215
The rainbow spanning forest problem 203
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem 199
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem 196
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks 194
Exact approaches for the orderly colored longest path problem: performance comparison 188
A Mathematical Programming Approach for the Maximum Labeled Clique Problem 181
Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage 177
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 174
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds 164
Application-motivated Nonlinear Programming 162
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints 151
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem 149
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints 147
The Labeled Maximum Matching Problem 144
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks 138
An improved heuristic approach for the interval immune transportation problem 125
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints 120
Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution NetworksSmart City 117
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem 109
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms 105
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions 105
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network 102
A reduction heuristic for the all-colors shortest path problem 96
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem 91
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem 89
A two-level metaheuristic for the all colors shortest path problem 89
Preface: Theoretical and algorithmic contributions to network optimization problems 80
Artificial neural network for technical feasibility prediction of seismic retrofitting in existing RC structures 59
Totale 16.521
Salva come PNG Salva come JPEG
Categoria #
all - tutte 32.798
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 32.798
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021136 0 0 0 0 0 0 0 0 0 0 40 96
2021/2022330 6 1 1 1 12 14 3 11 40 34 74 133
2022/2023484 49 68 9 65 36 100 2 46 77 7 22 3
2023/2024238 21 55 20 14 14 26 8 9 4 7 7 53
2024/20251.528 25 30 7 27 51 77 177 52 84 58 109 831
2025/202611.825 2.485 4.712 2.973 100 422 133 367 92 221 310 10 0
Totale 16.521