SMRIGLIO, STEFANO
 Distribuzione geografica
Continente #
NA - Nord America 1.707
EU - Europa 1.043
AS - Asia 462
OC - Oceania 7
Continente sconosciuto - Info sul continente non disponibili 3
SA - Sud America 3
AF - Africa 1
Totale 3.226
Nazione #
US - Stati Uniti d'America 1.696
IE - Irlanda 384
CN - Cina 237
TR - Turchia 204
DE - Germania 130
IT - Italia 113
GB - Regno Unito 112
UA - Ucraina 105
SE - Svezia 86
FI - Finlandia 53
FR - Francia 29
BE - Belgio 15
CA - Canada 11
IN - India 10
AU - Australia 6
PL - Polonia 4
EU - Europa 3
HK - Hong Kong 3
NL - Olanda 3
JP - Giappone 2
NO - Norvegia 2
VN - Vietnam 2
AR - Argentina 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
CH - Svizzera 1
CL - Cile 1
EE - Estonia 1
EG - Egitto 1
ES - Italia 1
HU - Ungheria 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
LT - Lituania 1
MD - Moldavia 1
NZ - Nuova Zelanda 1
PE - Perù 1
UZ - Uzbekistan 1
Totale 3.226
Città #
Jacksonville 421
Dublin 384
Chandler 372
Izmir 108
San Mateo 79
Boardman 75
Nanjing 74
Ann Arbor 61
Wilmington 58
Lawrence 57
Princeton 57
New York 38
Ashburn 31
Nanchang 31
Mountain View 25
L'aquila 24
Milan 24
Rome 23
Shenyang 22
Woodbridge 20
Jiaxing 16
Seattle 16
Brussels 15
Hebei 14
Grafing 13
Tianjin 13
Verona 11
Des Moines 10
Kunming 10
San Francisco 9
Toronto 8
Auburn Hills 7
Jinan 7
Beijing 6
Changsha 6
Houston 6
Ningbo 6
Norwalk 6
Changchun 5
Guangzhou 5
Tappahannock 5
Paris 4
Shanghai 4
Taizhou 4
Venezia 4
Dearborn 3
Helsinki 3
Sydney 3
Warsaw 3
Aquila 2
Central 2
Chieti 2
Dong Ket 2
Hangzhou 2
Menlo Park 2
Venafro 2
Zhengzhou 2
Bangalore 1
Brisbane 1
Budapest 1
Cairo 1
Callao 1
Canberra 1
Cedar Knolls 1
Chisinau 1
Clemson 1
Colombo 1
Edinburgh 1
El Paso 1
Haikou 1
Islington 1
La Buissière 1
Lanzhou 1
London 1
Los Angeles 1
Madrid 1
Markham 1
Melbourne 1
Montréal 1
Orange 1
Oslo 1
Phoenix 1
Porirua 1
Regina 1
Sarajevo 1
Stockholm 1
Tallinn 1
Tashkent 1
Tokyo 1
Vilnius 1
Washington 1
Würzburg 1
Zurich 1
Totale 2.258
Nome #
Strengthening Chvátal-Gomory cuts for the stable set problem 96
Ellipsoidal relaxations of the stable set problem: theory and algorithms 85
A Competitive Scheduling Problem and its Relevance to UMTS Channel Assignment 81
Time Offset Optimization in Digital Broadcasting 79
Bilevel Branching 77
Il Libro Bianco sulla Televisione Digitale Terrestre 77
Routing Concurrent Video Signals over SDH Networks 77
Combinatorial Optimization and Application: in memory of Mario Lucertini 76
The Network Packing Problem in Terrestrial Broadcasting 75
An implicit enumeration scheme for the batch selection problem 73
An Application of the Lovász-Schrijver M(K, K) Operator to the Stable Set Problem 73
A branch-and-cut for the stable set problem based on an ellipsoidal relaxation 70
A new approach to the stable set problem based on ellipsoids 69
Staffing and scheduling flexible call centers by two-stage robust optimization 68
A Lagrangian Heuristic for Satellite Range Scheduling with Resource Constraints 65
Robust Shift Scheduling in Call Centers 65
Orbital Branching 61
A Lagrangian Heuristic for a Multimission Automatic Scheduler 59
Strong lift-and-project cutting planes for the stable set problem 59
A Set Packing Model for the Ground-Holding Problem in Congested Networks 59
Combinatorial optimisation in radiotherapy treatment planning 59
Constraint Orbital Branching 58
Disjunctive Cuts through Projections for the Set Covering Problem 58
Orbital Branching 58
Planning the analog to digital migration in terrestrial broadcasting networks 57
Cutting planes for the Stable Set Problem by Semidefinite Programming 57
A Time Indexed Formulation for Scheduling Commands on a Satellite Constellation 57
A three-dimensional matching model for perishable production scheduling 56
Computational study of separation algorithms for clique inequalities 56
A Branch-and-Cut Algorithm for the Maximum Cardinality Stable Set Problem 55
The Shortest Walk to Watch TV 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
Il percorso più breve per vedere la TV 52
Assignment and Sequencing of Parts to Autonomous Workstations 51
Optimal Assignment of High-Multiplicity Flight Plans to Dispatchers 51
An ellipsoidal relaxation for the stable set problem 51
Cutting planes for the Stable Set Problem by Semidefinite Programming 50
A Hybrid Integer Programming Model for Multi-Activity Shift Scheduling 49
Constraint Orbital Branching 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
Network Optimization in Air Traffic Management 47
Solving Steiner Triple Covering Problems 43
Cutting Planes from a Convex Quadratic Relaxation of the Stable Set Problem 40
Il percorso più breve per vedere la televisione 39
Comparing deep and shallow neural networks in forecasting call center arrivals 37
Solving Steiner Triple Covering Problems 36
The stable set problem: Clique and nodal inequalities revisited 36
A dynamic dial-a-ride model for optimal vehicle routing in a wafer fab 32
Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks 29
Orbital Conflict: Cutting Planes for Symmetric Integer Programs 25
Optimizing Nozzle Travel Time in Proton Therapy 18
Spread-Out Bragg Peak in Treatment Planning System by Mixed Integer Linear Programming: a Proof of Concept 4
A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout 3
Totale 3.263
Categoria #
all - tutte 10.719
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 10.719


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019178 0 0 0 0 0 0 0 0 0 6 13 159
2019/2020428 105 5 54 4 0 54 70 14 58 8 2 54
2020/2021432 8 55 1 56 54 10 57 1 60 13 105 12
2021/2022335 13 32 34 17 3 14 6 23 22 14 28 129
2022/20231.079 73 53 16 106 89 119 1 67 480 8 35 32
2023/2024208 46 12 10 46 14 54 4 15 3 4 0 0
Totale 3.263