UniSa - IRIS Institutional Research Information System

CARRABS, Francesco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.106
AS - Asia 1.489
EU - Europa 832
SA - Sud America 103
AF - Africa 4
Continente sconosciuto - Info sul continente non disponibili 1
Totale 4.535
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.091
HK - Hong Kong 871
IT - Italia 307
CN - Cina 218
SG - Singapore 183
RU - Federazione Russa 166
UA - Ucraina 101
BR - Brasile 97
VN - Vietnam 77
DE - Germania 72
IE - Irlanda 62
TR - Turchia 56
KR - Corea 34
SE - Svezia 34
FI - Finlandia 32
GB - Regno Unito 16
IN - India 15
CA - Canada 13
FR - Francia 11
NL - Olanda 9
PK - Pakistan 7
ES - Italia 5
GR - Grecia 4
NP - Nepal 4
PH - Filippine 4
AT - Austria 3
BD - Bangladesh 3
EC - Ecuador 3
JP - Giappone 3
TN - Tunisia 3
BE - Belgio 2
HR - Croazia 2
IQ - Iraq 2
JO - Giordania 2
MX - Messico 2
MY - Malesia 2
PL - Polonia 2
SA - Arabia Saudita 2
AE - Emirati Arabi Uniti 1
AR - Argentina 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
CY - Cipro 1
CZ - Repubblica Ceca 1
EG - Egitto 1
EU - Europa 1
IL - Israele 1
LT - Lituania 1
PS - Palestinian Territory 1
TH - Thailandia 1
TW - Taiwan 1
UY - Uruguay 1
VE - Venezuela 1
Totale 4.535
Salva come PNG Salva come JPEG
Città #
Hong Kong 867
Ann Arbor 520
Woodbridge 313
Chandler 211
Princeton 169
Jacksonville 136
Houston 120
Wilmington 98
Singapore 96
Dong Ket 64
Dublin 62
Izmir 54
Salerno 52
Ashburn 49
Nanjing 46
Beijing 41
Andover 34
Boardman 26
Pellezzano 24
Moscow 18
Sarno 18
Dallas 17
Munich 17
Arbus 16
Naples 15
Fairfield 14
Shenyang 14
Redwood City 13
Changsha 12
Ottawa 12
Turku 12
Mestre 11
Hebei 10
Jiaxing 9
Columbus 8
Düsseldorf 8
Jinan 8
The Dalles 8
Tianjin 8
Arzano 7
Casaluce 7
Fisciano 7
New York 7
Norwalk 7
Rome 7
São Paulo 7
Council Bluffs 6
Los Angeles 6
Nanchang 6
Rio de Janeiro 6
Santa Clara 6
Hangzhou 5
Indiana 5
Lahore 5
New Delhi 5
San Francisco 5
Shanghai 5
Atripalda 4
Cava De' Tirreni 4
Guangzhou 4
Hanoi 4
Ho Chi Minh City 4
London 4
McLean 4
Ptolemaida 4
San Diego 4
Stillwater 4
Wuhan 4
Besançon 3
Brasília 3
Brooklyn 3
Cambridge 3
Lucknow 3
Manchester 3
Milan 3
Nuremberg 3
Pontecagnano 3
San Giuseppe Vesuviano 3
Seattle 3
Sidi Bou Said 3
Somma Vesuviana 3
Taiyuan 3
Amman 2
Amsterdam 2
Avellino 2
Bari 2
Belo Horizonte 2
Belém 2
Cagliari 2
Capriolo 2
Chennai 2
Clifton 2
Curitiba 2
Da Nang 2
Dearborn 2
Dhaka 2
Dormagen 2
Eboli 2
Fonni 2
Haikou 2
Totale 3.461
Salva come PNG Salva come JPEG
Nome #
Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints 853
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks 138
Lower and upper bounds for the spanning tree with minimum branch vertices 138
Application-motivated Nonlinear Programming 133
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading 131
The rainbow spanning forest problem 131
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 126
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds 116
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem 115
On the Forward Shortest Path Tour Problem 112
A Mathematical Programming Approach for the Maximum Labeled Clique Problem 110
Maximizing lifetime in wireless sensor networks with multiple sensor families 102
A Tabu Search Approach for the Circle Packing Problem 102
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints 102
An exact approach for the grocery delivery problem in urban areas 99
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks 98
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem 97
A novel discretization scheme for the close enough traveling salesman problem 95
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints 95
The Labeled Maximum Matching Problem 89
Minimum Weighted Feedback Vertex Set on Diamonds 87
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 83
On the complexity of rainbow spanning forest problem 81
A genetic approach for the 2-edge-connected minimum branch vertices problem 78
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows 76
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading 74
The monochromatic set partitioning problem.Presentato al convegno Airo 2010, 07-10 Settembre 2010, Villa San Giovanni (RC). 74
The Set Orienteering Problem 74
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis 73
An evolutionary approach for the offsetting inventory cycle problem 69
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem 68
Prolonging lifetime in wireless sensor networks with interference constraints 65
The maximum labeled clique problem 63
An improved heuristic approach for the interval immune transportation problem 63
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network 62
A biased random-key genetic algorithm for the set orienteering problem 61
A reduction heuristic for the all-colors shortest path problem 56
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms 54
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem 53
Exact approaches for the orderly colored longest path problem: performance comparison 53
Preface: Theoretical and algorithmic contributions to network optimization problems 49
A two-level metaheuristic for the all colors shortest path problem 48
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 43
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs 41
Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage 37
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions 35
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem 34
A new formulation and a branch-and-cut algorithm for the set orienteering problem 32
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem 18
Artificial neural network for technical feasibility prediction of seismic retrofitting in existing RC structures 16
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP 16
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints 8
Totale 4.813
Salva come PNG Salva come JPEG
Categoria #
all - tutte 16.421
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 16.421
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/20251.528 25 30 7 27 51 77 177 52 84 58 109 831
2025/2026117 117 0 0 0 0 0 0 0 0 0 0 0
Totale 4.813