CARRABS, Francesco
 Distribuzione geografica
Continente #
AS - Asia 10.984
NA - Nord America 2.277
EU - Europa 880
SA - Sud America 128
AF - Africa 6
Continente sconosciuto - Info sul continente non disponibili 1
OC - Oceania 1
Totale 14.277
Nazione #
HK - Hong Kong 10.294
US - Stati Uniti d'America 2.249
IT - Italia 323
CN - Cina 236
SG - Singapore 211
RU - Federazione Russa 166
BR - Brasile 120
UA - Ucraina 101
VN - Vietnam 84
DE - Germania 80
IE - Irlanda 62
TR - Turchia 58
FI - Finlandia 34
KR - Corea 34
SE - Svezia 34
CA - Canada 22
GB - Regno Unito 20
IN - India 19
FR - Francia 12
LU - Lussemburgo 12
NL - Olanda 9
PK - Pakistan 8
AT - Austria 6
ES - Italia 6
JP - Giappone 6
BD - Bangladesh 4
EC - Ecuador 4
GR - Grecia 4
IQ - Iraq 4
NP - Nepal 4
PH - Filippine 4
JO - Giordania 3
MX - Messico 3
PL - Polonia 3
SA - Arabia Saudita 3
TN - Tunisia 3
AE - Emirati Arabi Uniti 2
BE - Belgio 2
EG - Egitto 2
HR - Croazia 2
IL - Israele 2
JM - Giamaica 2
MY - Malesia 2
AF - Afghanistan, Repubblica islamica di 1
AR - Argentina 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
BO - Bolivia 1
CY - Cipro 1
CZ - Repubblica Ceca 1
EU - Europa 1
KZ - Kazakistan 1
LT - Lituania 1
PS - Palestinian Territory 1
TH - Thailandia 1
TT - Trinidad e Tobago 1
TV - Tuvalu 1
TW - Taiwan 1
UY - Uruguay 1
VE - Venezuela 1
ZA - Sudafrica 1
Totale 14.277
Città #
Hong Kong 10.287
Ann Arbor 520
Woodbridge 313
Chandler 211
Princeton 169
Jacksonville 136
Singapore 124
Houston 120
Wilmington 98
Dallas 97
Dong Ket 64
Dublin 62
Ashburn 57
Izmir 54
Salerno 52
Nanjing 46
Beijing 41
Andover 34
Boardman 26
Pellezzano 24
Munich 23
Moscow 18
Sarno 18
Naples 17
Arbus 16
Fairfield 14
Shenyang 14
São Paulo 14
Los Angeles 13
Redwood City 13
Changsha 12
Esch-sur-Alzette 12
Ottawa 12
Turku 12
Mestre 11
Columbus 10
Hebei 10
Jiaxing 9
New York 9
Düsseldorf 8
Jinan 8
Rome 8
Santa Clara 8
The Dalles 8
Tianjin 8
Arzano 7
Casaluce 7
Fisciano 7
Ho Chi Minh City 7
Norwalk 7
San Francisco 7
Brooklyn 6
Council Bluffs 6
Nanchang 6
Rio de Janeiro 6
Shanghai 6
Guangzhou 5
Hangzhou 5
Hanoi 5
Indiana 5
Lahore 5
New Delhi 5
Seattle 5
Tokyo 5
Atripalda 4
Avellino 4
Boston 4
Cava De' Tirreni 4
Chennai 4
London 4
Manchester 4
McLean 4
Montreal 4
Phoenix 4
Ptolemaida 4
San Diego 4
Stillwater 4
Wuhan 4
Amman 3
Besançon 3
Bologna 3
Brasília 3
Cambridge 3
Denver 3
Lappeenranta 3
Lucknow 3
Milan 3
Nuremberg 3
Pontecagnano 3
San Giuseppe Vesuviano 3
Sidi Bou Said 3
Somma Vesuviana 3
Taiyuan 3
Warsaw 3
Amsterdam 2
Ankara 2
Atlanta 2
Bari 2
Belo Horizonte 2
Belém 2
Totale 13.068
Nome #
Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints 2.647
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows 880
The maximum labeled clique problem 551
On the Forward Shortest Path Tour Problem 537
A biased random-key genetic algorithm for the set orienteering problem 480
A novel discretization scheme for the close enough traveling salesman problem 466
On the complexity of rainbow spanning forest problem 448
The monochromatic set partitioning problem.Presentato al convegno Airo 2010, 07-10 Settembre 2010, Villa San Giovanni (RC). 441
A Tabu Search Approach for the Circle Packing Problem 437
Maximizing lifetime in wireless sensor networks with multiple sensor families 427
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading 421
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs 412
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 377
A genetic approach for the 2-edge-connected minimum branch vertices problem 340
An evolutionary approach for the offsetting inventory cycle problem 332
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints 302
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis 295
An exact approach for the grocery delivery problem in urban areas 293
The Set Orienteering Problem 289
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP 269
A new formulation and a branch-and-cut algorithm for the set orienteering problem 234
Lower and upper bounds for the spanning tree with minimum branch vertices 226
Prolonging lifetime in wireless sensor networks with interference constraints 225
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading 188
Minimum Weighted Feedback Vertex Set on Diamonds 185
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem 164
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem 162
Exact approaches for the orderly colored longest path problem: performance comparison 162
The rainbow spanning forest problem 152
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks 144
Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage 144
A Mathematical Programming Approach for the Maximum Labeled Clique Problem 142
Application-motivated Nonlinear Programming 141
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 137
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds 125
The Labeled Maximum Matching Problem 122
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem 110
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints 110
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks 104
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints 103
Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution NetworksSmart City 93
An improved heuristic approach for the interval immune transportation problem 82
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem 74
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints 72
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms 68
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network 68
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions 66
A reduction heuristic for the all-colors shortest path problem 62
Preface: Theoretical and algorithmic contributions to network optimization problems 60
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem 58
A two-level metaheuristic for the all colors shortest path problem 52
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem 51
Artificial neural network for technical feasibility prediction of seismic retrofitting in existing RC structures 26
Totale 14.556
Categoria #
all - tutte 28.156
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 28.156


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021308 0 0 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/20269.860 2.485 4.712 2.663 0 0 0 0 0 0 0 0 0
Totale 14.556