CINECA IRIS Institutional Research Information System

SCUTELLA', MARIA GRAZIA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.228
EU - Europa 2.651
AS - Asia 1.495
AF - Africa 113
SA - Sud America 59
OC - Oceania 10
Continente sconosciuto - Info sul continente non disponibili 1
Totale 10.557
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.066
IT - Italia 1.290
CN - Cina 708
SG - Singapore 411
SE - Svezia 364
BG - Bulgaria 241
DE - Germania 167
CA - Canada 158
TR - Turchia 131
UA - Ucraina 124
GB - Regno Unito 117
RU - Federazione Russa 102
FI - Finlandia 98
VN - Vietnam 92
HK - Hong Kong 91
CI - Costa d'Avorio 60
BR - Brasile 55
CH - Svizzera 44
SN - Senegal 39
IN - India 28
FR - Francia 24
BE - Belgio 16
NO - Norvegia 14
IR - Iran 12
AU - Australia 9
HU - Ungheria 9
BJ - Benin 7
NL - Olanda 6
AT - Austria 5
GR - Grecia 4
IE - Irlanda 4
KR - Corea 4
LU - Lussemburgo 4
PL - Polonia 4
EC - Ecuador 3
LT - Lituania 3
MA - Marocco 3
PK - Pakistan 3
RO - Romania 3
BD - Bangladesh 2
CZ - Repubblica Ceca 2
ES - Italia 2
HR - Croazia 2
JP - Giappone 2
MX - Messico 2
OM - Oman 2
AO - Angola 1
AR - Argentina 1
BN - Brunei Darussalam 1
CR - Costa Rica 1
DO - Repubblica Dominicana 1
EU - Europa 1
IQ - Iraq 1
KE - Kenya 1
KH - Cambogia 1
KW - Kuwait 1
KZ - Kazakistan 1
LV - Lettonia 1
NG - Nigeria 1
NP - Nepal 1
NZ - Nuova Zelanda 1
PS - Palestinian Territory 1
PT - Portogallo 1
TN - Tunisia 1
TW - Taiwan 1
UZ - Uzbekistan 1
Totale 10.557
Salva come PNG Salva come JPEG
Città #
Woodbridge 973
Houston 584
Ann Arbor 570
Fairfield 554
Chandler 526
Santa Clara 460
Serra 346
Milan 323
Ashburn 273
Sofia 241
Shanghai 221
Cambridge 201
Jacksonville 196
Wilmington 195
Seattle 186
Beijing 155
New York 153
Ottawa 153
Singapore 112
Boardman 104
Izmir 97
Princeton 97
Lawrence 92
Hong Kong 86
Nanjing 85
Medford 67
Rome 66
Abidjan 60
Dong Ket 48
Bern 40
Dakar 39
Dearborn 39
Lancaster 39
Jüchen 37
Nanchang 37
Des Moines 36
Istanbul 31
Council Bluffs 28
San Diego 27
Ogden 25
Pisa 24
Pune 23
Kunming 22
Redwood City 22
Frankfurt am Main 21
La Spezia 21
Bremen 20
Boulder 19
Florence 19
Shenyang 19
Gavorrano 18
Bondeno 17
Los Angeles 17
Pomezia 17
Tianjin 17
Hebei 15
Brussels 14
Fuzhou 14
Helsinki 14
Castell'azzara 12
Monmouth Junction 12
Genoa 11
Hefei 11
Stavanger 10
Torino 10
Castagneto Carducci 9
Changsha 9
Hangzhou 9
London 9
Capannori 8
Dallas 8
Guangzhou 8
São Paulo 8
Auburn Hills 7
Cotonou 7
Norwalk 7
Buggiano 6
Ferrara 6
Napoli 6
Orange 6
Volterra 6
Altopascio 5
Andrano 5
Budapest 5
Chicago 5
Düsseldorf 5
Falkenstein 5
Jiaxing 5
Livorno 5
Phoenix 5
Rosignano Marittimo 5
Washington 5
Changchun 4
Dublin 4
Foggia 4
Lanzhou 4
Leawood 4
Lyon 4
Nuremberg 4
Piemonte 4
Totale 8.227
Salva come PNG Salva come JPEG
Nome #
Ottimizzazione Robusta 194
Mixed Integer Non-Linear Programming models for Green Network Design 179
Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks 179
Robust asset allocation strategies: relaxed versus classical robustness 177
Hardness of Robust Network Design 176
Joint assignment, scheduling and routing models to Home Care optimization: a pattern based approach 176
A multi-exchange heuristic for the single source capacitated facility location problem 175
A note on the parametric maximum flow problem and some related reoptimization issues 174
On improving optimal oblivious routing 163
Green Design of Wireless Local Area Networks by Multiband Robust Optimization 162
A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem 158
A strongly polynomial algorithm for the Uniform Balanced Network Flow Problem 149
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks 146
Hardness of Robust Network Design 145
Delay-constrained shortest paths: approximation algorithms and second-order cone models 145
Network Power Management: models and heuristic approaches 138
Robust optimisation of green wireless LANs under rate uncertainty and user mobility 138
Minimum time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights 137
Demand uncertainty in robust Home Care optimization 137
Static and Dynamic Routing Under Disjoint Dominant Extreme Demands 134
Pattern-based decompositions for human resource planning in home health care services 134
Energy-efficient resource allocation in wireless LANs under non-linear capacity constraints 134
A Multi-exchange Neighborhood for Minimum Makespan Machine Scheduling Problems 131
A note on Minimum Makespan Assembly Plans 130
Large scale local search heuristics for the Capacitated Vertex p-Center Problem 130
Color-Coding Algorithms to the Balanced Path Problem: Computational Issues 129
A modification of Lipski-Preparata's algorithm for the maximum matching problem on bipartite convex graphs 128
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case 128
A note on the parametric maximum flow problem and some related reoptimization issue 125
Appunti di Ricerca Operativa 125
Robust portfolio asset allocation and risk measures 124
Dual algorithms for the shortest path tree problem 124
The Skill Vehicle Routing Problem 122
Does traffic consolidation always lead to network energy savings? 121
Increasing the reliability of IEEE 802.11ad for industrial applications 121
Appunti di Ricerca Operativa 119
Color-coding heuristic approaches for the balanced path problem 118
A new algorithm for reoptimizing shortest paths when the arc costs change 117
The maximum cut congestion problem 116
Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis 116
Balanced paths in acyclic networks: tractable cases and related approaches 115
A note on Cherkasky's algorithm for the maximum flow problem 114
Shortest path algorithms in transportation models: classical and innovative aspects 113
Energy saving heuristics in Backbone Networks 112
A new dual algorithm for shortest path reoptimization 111
Polynomial Auction Algorithms for Shortest Paths 111
Balanced paths in telecommunication networks: some computational results 109
Distribution network design: new problems and related models 106
Flows on Hypergraphs 105
Network power management: Models and heuristic approaches 105
A note on Dowling-Gallier's Top-Down algorithm for Propositional Horn Satisfiability 105
Toward a programming environment for combinatorial optimization: a case study oriented to max-flow computations 104
The Cutting Stock Problem: a new model based on hypergraph flows 103
Robust Portfolio Asset Allocation: models and algorithmic approaches 103
Chance Constrained Network Design 103
Polynomially solvable satisfiability problems 103
Home Care optimization: impact of pattern generation policies on scheduling and routing decisions 100
The maximum flow problem: a max-preflow approach 99
Linear Programming Models for Traffic Engineering in 100% Survivable Networks under combined IS-IS/OSPF and MPLS-TE Protocols 99
Power savings with data rate guarantee in dense WLANs 99
Foreword (dedicated to the memory of Stefano Pallottino) 98
Dynamic Shortest Paths Minimizing Travel Times and Costs 98
An approximation algorithm for computing longest paths 98
Special Issue on the INOC 2009 Conference, April 26 - 29, 2009, Pisa, Italy (Special issue of Networks) 97
A unified algorithmic framework for Max-Flow computations (Toward the design of a combinatorial optimization programming environment) 97
Proceedings of INOC 2009 95
Pattern Generation Policies to Cope with Robustness in Home Care 94
Color-coding algorithms to the balanced path problems: computational issues 91
Power Aware Routing and Network Design with Bundled Links 90
Home Care Services Delivery: Equity Versus Efficiency in Optimization Models 90
null 88
null 87
Fast lower bounds for the capacitated minimum spanning tree problem 85
Revisione del volume "Annotated Bibliographies in Combinatorial Optimization" (Dell'Amico, Maffioli, Martello Eds.) 82
Facilities, Locations, Customers:Building blocks of location models. A survey 79
Directed Hypergraphs as a Modelling Paradigm 78
Editorial 77
I-READ 4.0: Internet-of-READers for an efficient asset management in large warehouses with high stock rotation index 76
Special Issue In Memory of Stefano Pallottino (Special Issue of Networks ) 75
A strongly polynomial algorithm for the Balanced network flow problem 73
Multi-exchange algorithms for the minimum makespan machine scheduling problem 73
The Hypergraph Simplex Approach: some experimental results 73
A fast heuristic approach for the assignment and sequencing storage location problem under a two level storage policy 72
Assigning and sequencing storage locations under a two level storage policy: Optimization model and matheuristic approaches 69
Teoria e Metodi di Riottimizzazione per Problemi di Flusso 68
Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques 67
null 62
Strongly polynomial auction algorithms for shortest paths" 61
Robust green Wireless Local Area Networks: A matheuristic approach 61
Addressing consistency and demand uncertainty in the Home Care planning problem 60
Optimal Access Point Power Management for Green IEEE 802.11 Networks 52
Proceedings of the 4th International Network Optimization Conference (INOC2009) 51
The Last-Mile Delivery Process with Trucks and Drones Under Uncertain Energy Consumption 45
Sequencing and routing in a large warehouse with high degree of product rotation 44
Maximum Flow Problems and an NP-complete variant on Edge Labeled Graphs 43
Design model of an IEEE 802.11ad infrastructure for TSN-based industrial applications 34
Robust portfolio asset allocation and risk measures 33
The Green Sequencing and Routing Problem 32
Models and valid inequalities to Asymmetric Skill-Based Routing Problems 30
A Continuous Time Physical Graph Based Formulation to Scheduled Service Network Design 28
Totale 10.599
Salva come PNG Salva come JPEG
Categoria #
all - tutte 27.888
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 27.888
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020360 0 0 0 0 0 0 0 0 147 89 98 26
2020/2021804 69 28 48 33 124 36 67 81 113 46 40 119
2021/20221.044 33 66 46 55 205 130 34 59 48 19 96 253
2022/20231.289 169 131 78 161 121 169 8 126 247 0 57 22
2023/20241.222 165 142 230 120 179 167 16 21 22 28 52 80
2024/20251.480 17 134 31 153 358 280 257 232 18 0 0 0
Totale 10.708