IRIS Institutional Research Information System - AIR Archivio Istituzionale della Ricerca

CORDONE, ROBERTO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 5.788
NA - Nord America 4.649
AS - Asia 4.449
SA - Sud America 490
AF - Africa 88
OC - Oceania 10
Continente sconosciuto - Info sul continente non disponibili 3
Totale 15.477
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.526
GB - Regno Unito 2.079
CN - Cina 1.533
SG - Singapore 1.400
IT - Italia 946
SE - Svezia 676
RU - Federazione Russa 515
DE - Germania 417
BR - Brasile 350
HK - Hong Kong 334
FR - Francia 265
IN - India 242
UA - Ucraina 228
VN - Vietnam 222
KR - Corea 181
BD - Bangladesh 154
IE - Irlanda 147
TR - Turchia 124
NL - Olanda 117
FI - Finlandia 94
EU - Europa 86
DK - Danimarca 85
CA - Canada 66
ID - Indonesia 59
CO - Colombia 55
JP - Giappone 45
AR - Argentina 38
MX - Messico 30
CI - Costa d'Avorio 29
GR - Grecia 27
PL - Polonia 27
ES - Italia 25
IQ - Iraq 22
ZA - Sudafrica 20
AT - Austria 18
CL - Cile 17
MY - Malesia 16
SK - Slovacchia (Repubblica Slovacca) 15
CH - Svizzera 14
PK - Pakistan 14
TW - Taiwan 13
SA - Arabia Saudita 12
BE - Belgio 11
PH - Filippine 11
RO - Romania 11
EC - Ecuador 10
IR - Iran 10
UZ - Uzbekistan 10
EG - Egitto 9
HU - Ungheria 9
VE - Venezuela 9
AZ - Azerbaigian 8
PT - Portogallo 8
AU - Australia 7
HR - Croazia 7
BG - Bulgaria 6
IL - Israele 6
JO - Giordania 6
LT - Lituania 6
MD - Moldavia 6
TN - Tunisia 6
DZ - Algeria 5
EE - Estonia 5
HN - Honduras 5
JM - Giamaica 5
KE - Kenya 5
NO - Norvegia 5
AE - Emirati Arabi Uniti 4
GT - Guatemala 4
KZ - Kazakistan 4
MA - Marocco 4
NG - Nigeria 4
NP - Nepal 4
BB - Barbados 3
BO - Bolivia 3
BY - Bielorussia 3
CZ - Repubblica Ceca 3
KG - Kirghizistan 3
LU - Lussemburgo 3
NZ - Nuova Zelanda 3
PE - Perù 3
PY - Paraguay 3
AF - Afghanistan, Repubblica islamica di 2
AM - Armenia 2
BA - Bosnia-Erzegovina 2
GA - Gabon 2
MK - Macedonia 2
OM - Oman 2
PA - Panama 2
QA - Qatar 2
SI - Slovenia 2
SV - El Salvador 2
TH - Thailandia 2
UY - Uruguay 2
AL - Albania 1
BH - Bahrain 1
BM - Bermuda 1
CG - Congo 1
CR - Costa Rica 1
DM - Dominica 1
Totale 15.550
Salva come PNG Salva come JPEG
Città #
Southend 1.865
Singapore 760
Milan 305
Hong Kong 302
Ashburn 295
San Jose 292
Santa Clara 279
Seattle 270
Chandler 264
Beijing 249
Council Bluffs 223
Princeton 196
Jacksonville 176
Wilmington 161
Hefei 141
Dublin 131
Los Angeles 122
Nanjing 120
Mountain View 116
Bengaluru 112
Fairfield 109
Ann Arbor 94
Dallas 94
Dearborn 89
Redmond 87
Moscow 86
Lauterbourg 84
Somerville 76
Guangzhou 71
Seoul 69
Serra 68
Des Moines 67
Ho Chi Minh City 66
Woodbridge 63
Buffalo 61
Jinan 60
Houston 59
Sakarya 53
Andover 50
Boardman 50
Bogotá 50
Hanoi 50
Shanghai 48
Cambridge 47
Shenyang 44
Medford 43
Menlo Park 39
New York 39
Sunnyvale 39
Phoenix 38
Jakarta 35
Rome 33
Berlin 32
Frankfurt am Main 32
Chicago 31
Redwood City 31
Tianjin 31
Cangzhou 30
Abidjan 29
Hangzhou 29
Nanchang 29
The Dalles 28
Tokyo 28
Changsha 27
Columbus 27
Melegnano 25
Athens 22
Shenzhen 21
São Paulo 20
Fuzhou 19
Dong Ket 18
Zhengzhou 18
Warsaw 17
Bratislava 15
Hebei 15
Eitensheim 14
Helsinki 14
Nuremberg 14
Toronto 14
Turin 14
Rosate 13
Baghdad 12
Brescia 12
Bühl 12
Haiphong 12
Jiaxing 12
Kwai Chung 12
Brussels 11
Haikou 11
Ottawa 11
Pisa 11
Dhaka 10
Lanzhou 10
Montreal 10
Naples 10
Ningbo 10
San Diego 10
Verona 10
Belo Horizonte 9
Istanbul 9
Totale 9.201
Salva come PNG Salva come JPEG
Nome #
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization 333
Better and faster solutions for the maximum diversity problem 288
14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016) 282
Models and algorithms for balanced rostering with limited skills 274
Balanced clustering for efficient detection of scientific plagiarism 259
Tabu search versus GRASP for the maximum diversity problem 247
On finding connected balanced partitions of trees 246
Tabu search vs. GRASP for the maximum diversity problem 244
An Exact Algorithm for the Node Weighted Steiner Tree Problem 242
Uniform partition of graphs: Complexity results, algorithms and formulations 239
A variable neighborhood search algorithm for the multimode set covering problem 229
Metaheuristics for the Minimum Gap Graph Partitioning Problem 226
Models and algorithms for location and relocation of ambulances 225
Column-generation based bounds for the homogeneous areas problem 223
Enumeration algorithms for minimal siphons in Petri nets based on place constraints 219
Toward Smart Building Design Automation: Extensible CAD Framework for Indoor Localization Systems Deployment 216
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization 216
Semidefinite bounds for the maximum diversity problem 214
The multicommodity multilevel bottleneck assignment problem 212
Bounds and solutions for strategic, tactical and operational ambulance location 212
Some results on the computation of minimal siphons in Petri nets 205
The multimode covering location problem 205
A modified algorithm for perceived contrast measure in digital images 204
A relax-and-cut algorithm for the knapsack node weighted Steiner tree problem 193
Coloured ant system and local search to design local telecommunication networks 191
Employee workload balancing by graph partitioning 188
Solving the on-line Dial-a-Ride problem 184
An approximation algorithm for fully testable kEP-SOP networks 184
Solving the swath segment selection problem through Lagrangean relaxation 183
On the complexity of graph tree partition problems 182
An approximation algorithm for generalized EXOR projected sums of products 181
EXOR projected sum of products 181
Combined siphon and marking generation for deadlock prevention in Petri nets 178
On the Partition of an Administrative Region into Homogeneous District 178
On projecting sums of products 176
Molecular dynamics simulation of 26-unit segments of p(NIPAAm) and of p({NIPAAm}) "doped" with amino-acid-based comonomers 175
A reachability graph partitioning technique for the analysis of deadlock prevention methods in bounded Petri nets 175
Balanced compact clustering for efficient range queries in metric spaces 175
Selective siphon control for deadlock prevention in Petri nets 174
Some polynomial special cases for the Minimum Gap Graph Partitioning Problem 172
A heuristic approach to the overnight security service problem 169
Using speculative computation and parallelizing techniques to improve scheduling of control based designs 168
A branch and bound approach for the design of decentralized supervisors in Petri net models 168
Logic synthesis of EXOR projected sum of products 167
The demand-dependent optimization of regular train timetables 164
A combinatorial branch and bound for the safe set problem 163
Partitioning and scheduling of task graphs on partially dynamically reconfigurable FPGAs 162
The Prize-collecting Scheduling Problem with Deadlines 161
Efficient deadlock prevention in Petri Nets through the generation of selected siphons 160
The demand-dependent optimization of regular train timetables 160
A subexponential algorithm for the coloured tree partition problem 158
Heuristic and exact approaches to the quadratic minimum spanning tree problem 156
A Heuristic for the Vehicle Routing Problem with Time Windows 154
An efficient heuristic approach to solve the unate covering problem 153
A recursive method for minimal siphon enumeration in Petri Nets 151
The optimization of kEP-SOPs : computational complexity, approximability and experiments 150
Instabilities in creative professions: a minimal model 150
Optimal selection of contracts and work-shifts in multi-skill call centers 148
A decision support tool to plan shifts in a home for the aged 148
Siphon classification for deadlock prevention in Petri nets 147
Optimal results and tight bounds for the maximum diversity problem 146
Optimization of multi-skill call centers contracts and work-shifts 143
Supervisory Control of Timed Discrete-Event Systems With Logical and Temporal Specifications 141
An integer optimization approach for reverse engineering of gene regulatory networks 140
Non redundant siphon control in ordinary Petri nets 137
Upper and lower bounds for the Homogeneous Areas Problem 137
Maximum feasible subsystems of distance geometry constraints 136
A subexponential algorithm for the coloured tree partition problem 130
Parsimonious monitor control of Petri net models of flexible manufacturing systems 130
A GRASP metaheuristic for microarray data analysis 129
The safe set problem on particular graph classes 128
Comparing local search metaheuristics for the maximum diversity problem 123
Solving the quadratic minimum spanning tree problem 122
A Revisited Branch and Bound Method for the Weighted Safe Set Problem 121
Compact and decentralized supervisors for general constraint enforcement in Petri net models 121
Constructive–destructive heuristics for the Safe Set Problem 120
GRASP approaches to the Weighted Safe Set Problem 119
Designing optimal deadlock avoidance policies for sequential resource allocation systems through classification theory : existence results and customized algorithms 116
Optimizing the demand captured by a railway system with a regular timetable 116
Simulation and optimization models for emergency management systems planning 115
Maximum feasible subsystem of distance geometry constraints 114
Compact supervisors for general constraint enforcement in Petri net models with uncontrollable transitions 110
Parsimonious deadlock-free Petri net models of flexible manufacturing systems 110
Preemption-aware planning on Big-Data systems 108
Characterization of minimal and basis siphons with predicate logic and binary programming 106
On edge-aware path-based color spatial sampling for Retinex : from Termite Retinex to Light Energy-driven Termite Retinex 105
Cardinality constrained connected balanced partitions of trees under different criteria 104
Partitioning a graph into minimum gap components 104
A very large neighbourhood search approach to the swath segment selection problem 104
Construction and improvement algorithms for dispersion problems 103
Monitor optimization in Petri net control 102
Integrated design of optimal supervisors for the enforcement of static and behavioral constraints in Petri net models 94
A lagrangian relaxation approach for gene regulatory networks 93
Maximally permissive deadlock avoidance for sequential resource allocation systems using disjunctions of linear classifiers 91
Multimode extensions of Combinatorial Optimization problems 91
Decentralized monitors design for Petri net models 84
Constructive and Destructive Methods in Heuristic Search 77
Computation of K-reachable paths in Petri nets 75
Floor plan design and automatic nodes deployment for indoor location and monitoring systems 69
An efficient heuristic approach to solve the unate covering problem [logic minimisation] 62
Totale 16.163
Salva come PNG Salva come JPEG
Categoria #
all - tutte 42.413
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 42.413
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021107 0 0 0 0 0 0 0 0 0 0 0 107
2021/2022967 58 58 28 98 67 92 90 51 60 57 77 231
2022/20231.183 197 93 109 123 151 196 36 79 98 38 44 19
2023/2024615 36 63 21 11 80 99 14 31 30 33 76 121
2024/20252.250 72 306 38 177 336 74 122 266 116 121 192 430
2025/20264.301 327 271 447 351 409 330 483 336 448 507 299 93
Totale 16.326