IRIS
ROSSI, FABRIZIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.171
EU - Europa 1.335
AS - Asia 588
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 6
SA - Sud America 5
AF - Africa 1
Totale 4.113
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.158
IE - Irlanda 481
CN - Cina 307
TR - Turchia 246
DE - Germania 193
IT - Italia 149
GB - Regno Unito 132
UA - Ucraina 129
SE - Svezia 115
FI - Finlandia 66
FR - Francia 33
CA - Canada 13
BE - Belgio 12
IN - India 11
SG - Singapore 11
CZ - Repubblica Ceca 7
AU - Australia 5
EU - Europa 5
PL - Polonia 5
HK - Hong Kong 4
NL - Olanda 3
A2 - ???statistics.table.value.countryCode.A2??? 2
CL - Cile 2
ES - Italia 2
JP - Giappone 2
NO - Norvegia 2
RU - Federazione Russa 2
VN - Vietnam 2
AR - Argentina 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
CH - Svizzera 1
EE - Estonia 1
EG - Egitto 1
HU - Ungheria 1
IL - Israele 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
NZ - Nuova Zelanda 1
PE - Perù 1
PY - Paraguay 1
UZ - Uzbekistan 1
Totale 4.113
Salva come PNG Salva come JPEG
Città #
Jacksonville 517
Chandler 487
Dublin 481
Izmir 129
Boardman 118
San Mateo 93
Nanjing 92
Lawrence 71
Princeton 71
Wilmington 64
Ann Arbor 59
New York 52
Ashburn 42
Nanchang 41
Grafing 35
Milan 30
Mountain View 30
Rome 30
L'aquila 29
Shenyang 23
Woodbridge 22
Jiaxing 20
Hebei 18
Tianjin 18
Los Angeles 17
Seattle 17
Verona 15
Kunming 13
Brussels 12
Des Moines 12
San Francisco 10
Jinan 9
Toronto 9
Auburn Hills 8
Beijing 7
Brno 7
Changsha 7
Guangzhou 7
Munich 7
Berlin 6
Changchun 6
Helsinki 6
Houston 6
L’Aquila 6
Ningbo 6
Norwalk 6
Shanghai 6
Singapore 6
Taizhou 6
Dearborn 5
Falls Church 5
Tappahannock 5
Chieti 4
Paris 4
Venezia 4
Warsaw 4
Sydney 3
Zhengzhou 3
Aquila 2
Central 2
Dong Ket 2
Haikou 2
Hangzhou 2
Hanover 2
Lanzhou 2
Markham 2
Menlo Park 2
Secaucus 2
Stockholm 2
Venafro 2
Asunción 1
Bangalore 1
Bari 1
Bremen 1
Brisbane 1
Budapest 1
Cairo 1
Callao 1
Canberra 1
Cedar Knolls 1
Clemson 1
Colombo 1
Concepción 1
Düsseldorf 1
Edinburgh 1
El Paso 1
Hefei 1
Islington 1
Kitzingen 1
La Buissière 1
Lishui 1
London 1
Madrid 1
Montréal 1
Odesa 1
Orange 1
Oslo 1
Phoenix 1
Porirua 1
Regina 1
Totale 2.880
Salva come PNG Salva come JPEG
Nome #
Strengthening Chvátal-Gomory cuts for the stable set problem 100
Leveraging web analytics for automatically generating mobile navigation models 89
Ellipsoidal relaxations of the stable set problem: theory and algorithms 85
Optimal Resource Assignment through Negotiation in a Multi-agent Manufacturing System 83
Time Offset Optimization in Digital Broadcasting 79
Il Libro Bianco sulla Televisione Digitale Terrestre 78
Routing Concurrent Video Signals over SDH Networks 78
Bilevel Branching 77
The Network Packing Problem in Terrestrial Broadcasting 76
Combinatorial Optimization and Application: in memory of Mario Lucertini 76
An Application of the Lovász-Schrijver M(K, K) Operator to the Stable Set Problem 75
An implicit enumeration scheme for the batch selection problem 73
A branch-and-cut for the stable set problem based on an ellipsoidal relaxation 70
Staffing and scheduling flexible call centers by two-stage robust optimization 70
A new approach to the stable set problem based on ellipsoids 69
A Lagrangian Heuristic for Satellite Range Scheduling with Resource Constraints 65
An Exact Algorithm for the Batch Sequencing Problem in a Two-Machine Flow Shop with Limited Buffer 65
Robust Shift Scheduling in Call Centers 65
On the Cornaz-Jost transformation to solve the graph coloring problem 65
Lift-and-project cuts for mixed 0-1 programs: new computational results 65
A note on the Cornaz-Jost transformation to solve the graph coloring problem 63
Orbital Branching 61
A smart city run-time planner for multi-site congestion management 61
Combinatorial optimisation in radiotherapy treatment planning 61
Strong lift-and-project cutting planes for the stable set problem 60
A Set Packing Model for the Ground-Holding Problem in Congested Networks 60
Scheduling of Flexible Flow Lines in an Automotive Assembly Plant 59
A Lagrangian Heuristic for a Multimission Automatic Scheduler 59
Disjunctive Cuts through Projections for the Set Covering Problem 59
Computational study of separation algorithms for clique inequalities 59
Constraint Orbital Branching 58
Orbital Branching 58
Batch Scheduling in a Two Machine Flow Shop with Limited Buffer 57
Planning the analog to digital migration in terrestrial broadcasting networks 57
Cutting planes for the Stable Set Problem by Semidefinite Programming 57
Distributing Material Flows in a Manufacturing System with Large Product Mix: Two Models Based on Column Generation 57
A Time Indexed Formulation for Scheduling Commands on a Satellite Constellation 57
A Branch-and-Cut Algorithm for the Maximum Cardinality Stable Set Problem 56
The Shortest Walk to Watch TV 55
Assigning Jobs to Time Frames on a Single Machine to Minimize Total Tardiness 54
Linear Relaxations for the Maximum Stable Set Problem: a computational study 53
Interdiction Branching 53
Strong lift-and-project cutting planes for the Stable Set Problem 53
Approximating the Lovász θ Function with the Subgradient Method 53
Antenna Siting and Frequency Assignment by Integer Programming 53
Il percorso più breve per vedere la TV 52
An ellipsoidal relaxation for the stable set problem 51
Cutting planes for the Stable Set Problem by Semidefinite Programming 50
Cutting and Reuse: an Application from Automotive Component Manufacturing 50
An Optimization Problem Arising in the Design of Multiring Systems 50
Lot Scheduling in a Two Machine Cell with Swapping Device 49
A Hybrid Integer Programming Model for Multi-Activity Shift Scheduling 49
Constraint Orbital Branching 49
Tool handling and scheduling in a Two Machine Flexible Manufacturing Cell 49
A Unified View in Planning Broadcasting Networks 48
Solving Large Steiner Triple Covering Problems 48
Models and algorithms for terrestrial digital broadcasting 48
Optimization supports bilateral frequency regulation 48
Large-scale Call Center Agents Scheduling 48
Migration of Monoliths through the Synthesis of Microservices using Combinatorial Optimization 48
LP-based dual bounds for the maximum quasi-clique problem 45
Solving Steiner Triple Covering Problems 43
Cutting Planes from a Convex Quadratic Relaxation of the Stable Set Problem 41
The stable set problem: Clique and nodal inequalities revisited 41
Comparing deep and shallow neural networks in forecasting call center arrivals 41
Il percorso più breve per vedere la televisione 39
Solving Steiner Triple Covering Problems 36
Codon optimization by 0-1 linear programming 36
Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks 32
Orbital Conflict: Cutting Planes for Symmetric Integer Programs 31
Weak flow cover inequalities for the capacitated facility location problem 25
Classification of tumor types using XGBoost machine learning model: a vector space transformation of genomic alterations 22
Optimizing Nozzle Travel Time in Proton Therapy 21
Visitors flow management at Uffizi Gallery in Florence, Italy 18
From monolithic to microservice architecture: an automated approach based on graph clustering and combinatorial optimization 16
Spread-Out Bragg Peak in Treatment Planning System by Mixed Integer Linear Programming: a Proof of Concept 14
A Manifesto for Applied Data Science - Reasoning from a Business Perspective 14
Totale 4.188
Salva come PNG Salva come JPEG
Categoria #
all - tutte 15.558
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 15.558
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020519 128 6 65 3 2 67 89 15 69 7 3 65
2020/2021526 10 68 1 67 66 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/202516 16 0 0 0 0 0 0 0 0 0 0 0
Totale 4.188