UniSa - IRIS Institutional Research Information System

CARRABS, Francesco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 12.009
NA - Nord America 3.101
EU - Europa 1.271
SA - Sud America 231
AF - Africa 26
OC - Oceania 2
Continente sconosciuto - Info sul continente non disponibili 1
Totale 16.641
Salva come PNG Salva come JPEG
Nazione #
HK - Hong Kong 10.603
US - Stati Uniti d'America 3.038
IT - Italia 592
SG - Singapore 537
CN - Cina 334
VN - Vietnam 212
BR - Brasile 177
RU - Federazione Russa 171
UA - Ucraina 104
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
BD - Bangladesh 34
KR - Corea 34
CA - Canada 30
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 12
ES - Italia 11
PL - Polonia 10
ID - Indonesia 8
JM - Giamaica 8
MY - Malesia 8
NP - Nepal 8
CO - Colombia 7
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
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
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.641
Salva come PNG Salva come JPEG
Città #
Hong Kong 10.593
Ann Arbor 520
Singapore 327
Woodbridge 313
San Jose 296
Chandler 211
Princeton 169
Milan 154
Ashburn 144
Jacksonville 136
Houston 123
Dallas 115
Wilmington 98
Beijing 67
Dong Ket 64
Dublin 64
Izmir 54
The Dalles 54
Salerno 53
Council Bluffs 52
Lauterbourg 47
Nanjing 46
Rome 46
Hanoi 38
Ho Chi Minh City 37
Andover 34
New York 32
Santa Clara 32
Los Angeles 31
Naples 28
São Paulo 27
Boardman 26
Pellezzano 24
Munich 23
Moscow 18
Sarno 18
Arbus 16
Fairfield 14
Figino 14
Shenyang 14
Tokyo 14
Da Nang 13
Redwood City 13
Changsha 12
Denver 12
Esch-sur-Alzette 12
Haiphong 12
Ottawa 12
Turin 12
Turku 12
Brooklyn 11
Mestre 11
Baghdad 10
Columbus 10
Hebei 10
London 10
Montreal 10
Orem 10
Warsaw 10
Chennai 9
Jiaxing 9
Lahore 9
Phoenix 9
Bologna 8
Düsseldorf 8
Fisciano 8
Jinan 8
Rio de Janeiro 8
Tianjin 8
Arzano 7
Buffalo 7
Casaluce 7
Jeddah 7
Norwalk 7
San Francisco 7
Stockholm 7
Atlanta 6
Boston 6
Chicago 6
Frankfurt am Main 6
Guangzhou 6
Kingston 6
Mumbai 6
Nanchang 6
New Delhi 6
Seattle 6
Shanghai 6
Avellino 5
Curitiba 5
Dhaka 5
Hangzhou 5
Indiana 5
Lappeenranta 5
Memphis 5
Nuremberg 5
Poplar 5
Amman 4
Amsterdam 4
Ankara 4
Atripalda 4
Totale 14.648
Salva come PNG Salva come JPEG
Nome #
Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints 2.691
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows 936
The maximum labeled clique problem 584
On the Forward Shortest Path Tour Problem 578
A biased random-key genetic algorithm for the set orienteering problem 520
A novel discretization scheme for the close enough traveling salesman problem 515
On the complexity of rainbow spanning forest problem 497
Maximizing lifetime in wireless sensor networks with multiple sensor families 493
A Tabu Search Approach for the Circle Packing Problem 488
The monochromatic set partitioning problem.Presentato al convegno Airo 2010, 07-10 Settembre 2010, Villa San Giovanni (RC). 472
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs 456
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading 455
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 410
A genetic approach for the 2-edge-connected minimum branch vertices problem 404
An evolutionary approach for the offsetting inventory cycle problem 370
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints 361
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis 354
The Set Orienteering Problem 330
An exact approach for the grocery delivery problem in urban areas 327
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP 312
A new formulation and a branch-and-cut algorithm for the set orienteering problem 287
Lower and upper bounds for the spanning tree with minimum branch vertices 278
Prolonging lifetime in wireless sensor networks with interference constraints 264
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading 233
Minimum Weighted Feedback Vertex Set on Diamonds 217
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem 209
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks 207
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem 205
The rainbow spanning forest problem 204
Exact approaches for the orderly colored longest path problem: performance comparison 194
A Mathematical Programming Approach for the Maximum Labeled Clique Problem 188
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem 187
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 186
Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage 185
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds 182
Application-motivated Nonlinear Programming 164
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints 161
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints 155
The Labeled Maximum Matching Problem 151
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks 139
An improved heuristic approach for the interval immune transportation problem 136
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints 130
Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution NetworksSmart City 127
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem 117
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions 114
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms 111
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network 110
A reduction heuristic for the all-colors shortest path problem 101
A two-level metaheuristic for the all colors shortest path problem 94
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem 94
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem 92
Preface: Theoretical and algorithmic contributions to network optimization problems 83
Artificial neural network for technical feasibility prediction of seismic retrofitting in existing RC structures 62
Totale 16.920
Salva come PNG Salva come JPEG
Categoria #
all - tutte 34.161
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 34.161
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/202612.171 2.485 4.712 2.973 100 422 133 367 92 221 310 91 265
2026/202753 53 0 0 0 0 0 0 0 0 0 0 0
Totale 16.920