UniSa - IRIS Institutional Research Information System

CARRABS, Francesco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.035
EU - Europa 776
AS - Asia 595
SA - Sud America 73
AF - Africa 4
Continente sconosciuto - Info sul continente non disponibili 1
Totale 3.484
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.022
IT - Italia 295
CN - Cina 218
SG - Singapore 182
RU - Federazione Russa 165
UA - Ucraina 101
BR - Brasile 69
VN - Vietnam 64
IE - Irlanda 62
DE - Germania 55
TR - Turchia 55
SE - Svezia 33
KR - Corea 28
FI - Finlandia 20
CA - Canada 12
FR - Francia 11
GB - Regno Unito 10
IN - India 10
HK - Hong Kong 9
NL - Olanda 9
PK - Pakistan 7
GR - Grecia 4
PH - Filippine 4
AT - Austria 3
JP - Giappone 3
TN - Tunisia 3
BE - Belgio 2
EC - Ecuador 2
HR - Croazia 2
IQ - Iraq 2
MY - Malesia 2
NP - Nepal 2
AE - Emirati Arabi Uniti 1
BA - Bosnia-Erzegovina 1
BD - Bangladesh 1
BG - Bulgaria 1
CY - Cipro 1
EG - Egitto 1
ES - Italia 1
EU - Europa 1
IL - Israele 1
JO - Giordania 1
MX - Messico 1
PL - Polonia 1
PS - Palestinian Territory 1
SA - Arabia Saudita 1
TH - Thailandia 1
TW - Taiwan 1
UY - Uruguay 1
VE - Venezuela 1
Totale 3.484
Salva come PNG Salva come JPEG
Città #
Ann Arbor 520
Woodbridge 313
Chandler 211
Princeton 169
Jacksonville 136
Houston 119
Wilmington 98
Singapore 95
Dong Ket 64
Dublin 62
Izmir 54
Salerno 50
Ashburn 48
Nanjing 46
Beijing 41
Andover 34
Boardman 26
Pellezzano 24
Sarno 18
Moscow 17
Arbus 16
Fairfield 14
Shenyang 14
Dallas 13
Naples 13
Redwood City 13
Changsha 12
Ottawa 12
Mestre 11
Hebei 10
Jiaxing 9
Düsseldorf 8
Jinan 8
Tianjin 8
Arzano 7
Casaluce 7
Fisciano 7
Norwalk 7
Council Bluffs 6
Nanchang 6
Hangzhou 5
Hong Kong 5
Indiana 5
Lahore 5
Los Angeles 5
Rio de Janeiro 5
Rome 5
Santa Clara 5
Shanghai 5
Atripalda 4
Cava De' Tirreni 4
Guangzhou 4
McLean 4
New Delhi 4
Ptolemaida 4
San Diego 4
Stillwater 4
São Paulo 4
Wuhan 4
Besançon 3
Cambridge 3
London 3
Lucknow 3
Milan 3
New York 3
Nuremberg 3
Pontecagnano 3
Seattle 3
Sidi Bou Said 3
Somma Vesuviana 3
Taiyuan 3
The Dalles 3
Amsterdam 2
Avellino 2
Bari 2
Belém 2
Cagliari 2
Capriolo 2
Clifton 2
Dearborn 2
Dormagen 2
Eboli 2
Fonni 2
Haikou 2
Helsinki 2
Itabaiana 2
Limatola 2
Luzzano 2
Ningbo 2
Nocera Inferiore 2
Satellite Town 2
Southend 2
Taizhou 2
Tokyo 2
Toulouse 2
Washington 2
Xuzhou 2
Zagreb 2
Zhengzhou 2
Ajman 1
Totale 2.525
Salva come PNG Salva come JPEG
Nome #
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
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 119
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
On the Forward Shortest Path Tour Problem 103
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
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
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
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
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints 78
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
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading 70
Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints 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
An evolutionary approach for the offsetting inventory cycle problem 65
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 maximum labeled clique problem 60
An improved heuristic approach for the interval immune transportation problem 57
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network 56
A biased random-key genetic algorithm for the set orienteering problem 54
Exact approaches for the orderly colored longest path problem: performance comparison 50
A reduction heuristic for the all-colors shortest path problem 49
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem 47
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms 46
Preface: Theoretical and algorithmic contributions to network optimization problems 45
A two-level metaheuristic for the all colors shortest path problem 43
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 39
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs 36
Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage 33
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions 31
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
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem 14
Artificial neural network for technical feasibility prediction of seismic retrofitting in existing RC structures 13
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP 12
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints 3
Totale 3.762
Salva come PNG Salva come JPEG
Categoria #
all - tutte 14.622
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 14.622
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020124 0 0 0 0 0 0 0 0 0 0 111 13
2020/2021330 0 22 18 10 35 28 30 1 44 6 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/2025594 25 30 7 27 51 77 177 52 84 58 6 0
Totale 3.762