IRIS
ROSSI, FABRIZIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.248
EU - Europa 1.791
AS - Asia 1.787
SA - Sud America 265
AF - Africa 19
Continente sconosciuto - Info sul continente non disponibili 8
OC - Oceania 8
Totale 7.126
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.216
SG - Singapore 833
IE - Irlanda 482
CN - Cina 397
IT - Italia 259
TR - Turchia 258
DE - Germania 249
BR - Brasile 230
RU - Federazione Russa 185
HK - Hong Kong 183
GB - Regno Unito 159
UA - Ucraina 133
SE - Svezia 119
FI - Finlandia 95
FR - Francia 38
VN - Vietnam 28
IN - India 25
CA - Canada 24
NL - Olanda 16
PL - Polonia 15
BE - Belgio 12
JP - Giappone 12
AR - Argentina 11
ZA - Sudafrica 10
IQ - Iraq 9
ES - Italia 8
CZ - Repubblica Ceca 7
MX - Messico 6
AU - Australia 5
AZ - Azerbaigian 5
EC - Ecuador 5
EU - Europa 5
CL - Cile 4
ID - Indonesia 4
IL - Israele 4
PK - Pakistan 4
BD - Bangladesh 3
CO - Colombia 3
EG - Egitto 3
PE - Perù 3
PY - Paraguay 3
SA - Arabia Saudita 3
UY - Uruguay 3
UZ - Uzbekistan 3
A2 - ???statistics.table.value.countryCode.A2??? 2
BG - Bulgaria 2
LA - Repubblica Popolare Democratica del Laos 2
LK - Sri Lanka 2
NO - Norvegia 2
NZ - Nuova Zelanda 2
PS - Palestinian Territory 2
RS - Serbia 2
SY - Repubblica araba siriana 2
TN - Tunisia 2
VE - Venezuela 2
AE - Emirati Arabi Uniti 1
BA - Bosnia-Erzegovina 1
BO - Bolivia 1
CH - Svizzera 1
CI - Costa d'Avorio 1
EE - Estonia 1
GE - Georgia 1
GR - Grecia 1
GT - Guatemala 1
HN - Honduras 1
HU - Ungheria 1
IR - Iran 1
KE - Kenya 1
KG - Kirghizistan 1
KH - Cambogia 1
LT - Lituania 1
MA - Marocco 1
NR - Nauru 1
OM - Oman 1
PH - Filippine 1
PT - Portogallo 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
TW - Taiwan 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 7.126
Salva come PNG Salva come JPEG
Città #
Jacksonville 517
Singapore 492
Chandler 487
Dublin 482
Dallas 385
Boardman 195
Hong Kong 179
Santa Clara 171
Ashburn 140
Izmir 129
San Mateo 93
Nanjing 92
New York 78
Rome 77
Lawrence 71
Princeton 71
Wilmington 64
Ann Arbor 59
The Dalles 44
Nanchang 41
Los Angeles 40
Moscow 40
Milan 39
Munich 39
Grafing 35
L’Aquila 35
Beijing 31
Mountain View 30
L'aquila 29
Helsinki 27
Shenyang 23
Columbus 22
Woodbridge 22
São Paulo 21
Jiaxing 20
Seattle 20
Hebei 18
Tianjin 18
Hefei 17
Verona 16
Toronto 15
San Francisco 14
Warsaw 14
Des Moines 13
Kunming 13
Brussels 12
Ho Chi Minh City 12
Council Bluffs 11
Falkenstein 11
Houston 11
Tokyo 11
Frankfurt am Main 10
Shanghai 10
Amsterdam 9
Brooklyn 9
Guangzhou 9
Jinan 9
Auburn Hills 8
Johannesburg 8
Poplar 8
Brno 7
Changsha 7
Chicago 7
London 7
Orem 7
Secaucus 7
Berlin 6
Changchun 6
Hanoi 6
Ningbo 6
Norwalk 6
Paris 6
Phoenix 6
Stockholm 6
Taizhou 6
Atlanta 5
Brasília 5
Chennai 5
Chieti 5
Curitiba 5
Dearborn 5
Denver 5
Falls Church 5
Manchester 5
Tappahannock 5
Belo Horizonte 4
Buenos Aires 4
Campinas 4
Istanbul 4
Lappeenranta 4
Montreal 4
Providence 4
Rio de Janeiro 4
Venezia 4
Zhengzhou 4
Baghdad 3
Baku 3
Cairo 3
Guarulhos 3
Itaquaquecetuba 3
Totale 4.827
Salva come PNG Salva come JPEG
Nome #
Strengthening Chvátal-Gomory cuts for the stable set problem 156
Ellipsoidal relaxations of the stable set problem: theory and algorithms 145
The stable set problem: Clique and nodal inequalities revisited 142
Staffing and scheduling flexible call centers by two-stage robust optimization 129
Weak flow cover inequalities for the capacitated facility location problem 128
LP-based dual bounds for the maximum quasi-clique problem 127
Combinatorial optimisation in radiotherapy treatment planning 125
Leveraging web analytics for automatically generating mobile navigation models 123
Migration of Monoliths through the Synthesis of Microservices using Combinatorial Optimization 121
Computational study of separation algorithms for clique inequalities 118
Optimal Resource Assignment through Negotiation in a Multi-agent Manufacturing System 112
A branch-and-cut for the stable set problem based on an ellipsoidal relaxation 111
Bilevel Branching 107
Strong lift-and-project cutting planes for the stable set problem 107
Combinatorial Optimization and Application: in memory of Mario Lucertini 107
An ellipsoidal relaxation for the stable set problem 107
A smart city run-time planner for multi-site congestion management 107
Comparing deep and shallow neural networks in forecasting call center arrivals 107
Robust Shift Scheduling in Call Centers 105
The Network Packing Problem in Terrestrial Broadcasting 104
The Shortest Walk to Watch TV 104
Routing Concurrent Video Signals over SDH Networks 104
An Application of the Lovász-Schrijver M(K, K) Operator to the Stable Set Problem 103
Il Libro Bianco sulla Televisione Digitale Terrestre 103
Time Offset Optimization in Digital Broadcasting 102
An implicit enumeration scheme for the batch selection problem 101
Codon optimization by 0-1 linear programming 97
Optimizing Nozzle Travel Time in Proton Therapy 94
Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks 92
A Lagrangian Heuristic for Satellite Range Scheduling with Resource Constraints 91
Approximating the Lovász θ Function with the Subgradient Method 91
Cutting planes for the Stable Set Problem by Semidefinite Programming 90
Spread-Out Bragg Peak in Treatment Planning System by Mixed Integer Linear Programming: a Proof of Concept 88
A Manifesto for Applied Data Science - Reasoning from a Business Perspective 88
A note on the Cornaz-Jost transformation to solve the graph coloring problem 88
An Exact Algorithm for the Batch Sequencing Problem in a Two-Machine Flow Shop with Limited Buffer 88
Classification of tumor types using XGBoost machine learning model: a vector space transformation of genomic alterations 87
Orbital Conflict: Cutting Planes for Symmetric Integer Programs 87
Orbital Branching 86
On the Cornaz-Jost transformation to solve the graph coloring problem 85
Disjunctive Cuts through Projections for the Set Covering Problem 85
Orbital Branching 85
A Lagrangian Heuristic for a Multimission Automatic Scheduler 84
Lift-and-project cuts for mixed 0-1 programs: new computational results 84
A new approach to the stable set problem based on ellipsoids 84
Cutting and Reuse: an Application from Automotive Component Manufacturing 84
From monolithic to microservice architecture: an automated approach based on graph clustering and combinatorial optimization 83
Scheduling of Flexible Flow Lines in an Automotive Assembly Plant 83
Distributing Material Flows in a Manufacturing System with Large Product Mix: Two Models Based on Column Generation 83
A Set Packing Model for the Ground-Holding Problem in Congested Networks 83
Cutting Planes from a Convex Quadratic Relaxation of the Stable Set Problem 82
Batch Scheduling in a Two Machine Flow Shop with Limited Buffer 81
A Unified View in Planning Broadcasting Networks 81
Constraint Orbital Branching 80
A Branch-and-Cut Algorithm for the Maximum Cardinality Stable Set Problem 80
Il percorso più breve per vedere la TV 79
Strong lift-and-project cutting planes for the Stable Set Problem 79
Statistical models versus machine learning approach for competing risks in proctological surgery 78
Interdiction Branching 78
An Optimization Problem Arising in the Design of Multiring Systems 78
Planning the analog to digital migration in terrestrial broadcasting networks 77
Cutting planes for the Stable Set Problem by Semidefinite Programming 77
Assigning Jobs to Time Frames on a Single Machine to Minimize Total Tardiness 76
Models and algorithms for terrestrial digital broadcasting 75
Large-scale Call Center Agents Scheduling 75
A Time Indexed Formulation for Scheduling Commands on a Satellite Constellation 74
Optimization supports bilateral frequency regulation 72
Visitors flow management at Uffizi Gallery in Florence, Italy 71
Lot Scheduling in a Two Machine Cell with Swapping Device 71
Antenna Siting and Frequency Assignment by Integer Programming 69
Tool handling and scheduling in a Two Machine Flexible Manufacturing Cell 69
Linear Relaxations for the Maximum Stable Set Problem: a computational study 68
Constraint Orbital Branching 68
A Hybrid Integer Programming Model for Multi-Activity Shift Scheduling 67
Solving Steiner Triple Covering Problems 62
Solving Large Steiner Triple Covering Problems 62
Solving Steiner Triple Covering Problems 61
Il percorso più breve per vedere la televisione 59
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators 50
Enhancing Graph Edit Distance Computation: Stronger and Orientation-Based ILP Formulations 18
Totale 7.212
Salva come PNG Salva come JPEG
Categoria #
all - tutte 30.343
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.343
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021314 0 0 0 0 0 12 69 1 75 14 129 14
2021/2022448 14 38 50 19 8 38 6 36 26 24 34 155
2022/20231.397 90 70 25 134 125 153 1 99 603 15 41 41
2023/2024350 57 14 12 56 23 78 4 23 8 15 11 49
2024/20251.679 33 49 131 85 221 129 257 208 330 51 100 85
2025/20261.361 134 262 280 382 264 39 0 0 0 0 0 0
Totale 7.212