CARRABS, Francesco
 Distribuzione geografica
Continente #
AS - Asia 11.524
NA - Nord America 2.440
EU - Europa 910
SA - Sud America 144
AF - Africa 9
Continente sconosciuto - Info sul continente non disponibili 1
OC - Oceania 1
Totale 15.029
Nazione #
HK - Hong Kong 10.583
US - Stati Uniti d'America 2.400
SG - Singapore 374
IT - Italia 323
CN - Cina 286
RU - Federazione Russa 166
BR - Brasile 127
VN - Vietnam 109
UA - Ucraina 101
DE - Germania 80
IE - Irlanda 62
TR - Turchia 59
SE - Svezia 39
FI - Finlandia 36
KR - Corea 34
GB - Regno Unito 27
CA - Canada 26
IN - India 24
FR - Francia 12
LU - Lussemburgo 12
MX - Messico 9
NL - Olanda 9
PK - Pakistan 9
ES - Italia 8
JP - Giappone 8
PL - Polonia 8
AT - Austria 6
EC - Ecuador 6
AR - Argentina 5
BD - Bangladesh 5
GR - Grecia 4
IQ - Iraq 4
LT - Lituania 4
NP - Nepal 4
PH - Filippine 4
CZ - Repubblica Ceca 3
EG - Egitto 3
IL - Israele 3
JO - Giordania 3
SA - Arabia Saudita 3
TN - Tunisia 3
AE - Emirati Arabi Uniti 2
BE - Belgio 2
HR - Croazia 2
JM - Giamaica 2
MY - Malesia 2
VE - Venezuela 2
ZA - Sudafrica 2
AF - Afghanistan, Repubblica islamica di 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
BO - Bolivia 1
CL - Cile 1
CY - Cipro 1
DM - Dominica 1
DO - Repubblica Dominicana 1
EE - Estonia 1
EU - Europa 1
ID - Indonesia 1
KZ - Kazakistan 1
MD - Moldavia 1
PE - Perù 1
PS - Palestinian Territory 1
PT - Portogallo 1
RS - Serbia 1
SD - Sudan 1
TH - Thailandia 1
TT - Trinidad e Tobago 1
TV - Tuvalu 1
TW - Taiwan 1
UY - Uruguay 1
UZ - Uzbekistan 1
Totale 15.029
Città #
Hong Kong 10.576
Ann Arbor 520
Woodbridge 313
Chandler 211
Singapore 192
Princeton 169
Jacksonville 136
Houston 121
Dallas 113
Wilmington 98
Ashburn 82
Dong Ket 64
Dublin 62
Beijing 59
Izmir 54
Salerno 52
Nanjing 46
Andover 34
Los Angeles 27
Boardman 26
New York 25
Pellezzano 24
Munich 23
São Paulo 19
Moscow 18
Sarno 18
Naples 17
Arbus 16
Ho Chi Minh City 16
Fairfield 14
Shenyang 14
Redwood City 13
Changsha 12
Denver 12
Esch-sur-Alzette 12
Ottawa 12
Turku 12
Mestre 11
Santa Clara 11
Columbus 10
Hebei 10
Brooklyn 9
Jiaxing 9
Düsseldorf 8
Hanoi 8
Jinan 8
Rome 8
The Dalles 8
Tianjin 8
Warsaw 8
Arzano 7
Casaluce 7
Chennai 7
Fisciano 7
London 7
Montreal 7
Norwalk 7
San Francisco 7
Tokyo 7
Council Bluffs 6
Lahore 6
Nanchang 6
New Delhi 6
Phoenix 6
Rio de Janeiro 6
Shanghai 6
Stockholm 6
Boston 5
Guangzhou 5
Hangzhou 5
Indiana 5
Lappeenranta 5
Seattle 5
Atripalda 4
Avellino 4
Cava De' Tirreni 4
Chicago 4
Haiphong 4
Manchester 4
McLean 4
Poplar 4
Ptolemaida 4
San Diego 4
Stillwater 4
Wuhan 4
Amman 3
Ankara 3
Atlanta 3
Besançon 3
Bologna 3
Brasília 3
Cambridge 3
Charleston 3
Da Nang 3
Lucknow 3
Mexico City 3
Milan 3
Milwaukee 3
Nuremberg 3
Orem 3
Totale 13.582
Nome #
Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints 2.669
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows 902
The maximum labeled clique problem 561
On the Forward Shortest Path Tour Problem 553
A biased random-key genetic algorithm for the set orienteering problem 498
A novel discretization scheme for the close enough traveling salesman problem 490
On the complexity of rainbow spanning forest problem 466
A Tabu Search Approach for the Circle Packing Problem 460
Maximizing lifetime in wireless sensor networks with multiple sensor families 445
The monochromatic set partitioning problem.Presentato al convegno Airo 2010, 07-10 Settembre 2010, Villa San Giovanni (RC). 443
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs 434
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading 427
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 381
A genetic approach for the 2-edge-connected minimum branch vertices problem 365
An evolutionary approach for the offsetting inventory cycle problem 346
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints 331
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis 314
The Set Orienteering Problem 302
An exact approach for the grocery delivery problem in urban areas 296
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP 284
A new formulation and a branch-and-cut algorithm for the set orienteering problem 251
Lower and upper bounds for the spanning tree with minimum branch vertices 240
Prolonging lifetime in wireless sensor networks with interference constraints 233
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading 204
Minimum Weighted Feedback Vertex Set on Diamonds 197
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem 178
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem 176
Exact approaches for the orderly colored longest path problem: performance comparison 174
The rainbow spanning forest problem 167
Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage 161
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks 160
A Mathematical Programming Approach for the Maximum Labeled Clique Problem 158
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 153
Application-motivated Nonlinear Programming 148
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds 140
The Labeled Maximum Matching Problem 131
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints 125
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem 119
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints 118
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks 115
Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution NetworksSmart City 102
An improved heuristic approach for the interval immune transportation problem 95
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints 92
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem 90
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network 86
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms 81
A reduction heuristic for the all-colors shortest path problem 77
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions 77
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem 69
A two-level metaheuristic for the all colors shortest path problem 67
Preface: Theoretical and algorithmic contributions to network optimization problems 66
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem 57
Artificial neural network for technical feasibility prediction of seismic retrofitting in existing RC structures 34
Totale 15.308
Categoria #
all - tutte 30.531
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 30.531


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021280 0 0 0 0 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/202610.612 2.485 4.712 2.973 100 342 0 0 0 0 0 0 0
Totale 15.308