SCUTELLA', MARIA GRAZIA
 Distribuzione geografica
Continente #
NA - Nord America 9.084
AS - Asia 3.669
EU - Europa 3.243
SA - Sud America 530
Continente sconosciuto - Info sul continente non disponibili 183
AF - Africa 163
OC - Oceania 12
Totale 16.884
Nazione #
US - Stati Uniti d'America 8.811
IT - Italia 1.524
SG - Singapore 1.199
CN - Cina 1.128
HK - Hong Kong 512
BR - Brasile 443
SE - Svezia 368
VN - Vietnam 284
BG - Bulgaria 242
DE - Germania 229
CA - Canada 194
GB - Regno Unito 152
TR - Turchia 144
FR - Francia 136
FI - Finlandia 131
UA - Ucraina 129
RU - Federazione Russa 109
KR - Corea 97
IN - India 72
JP - Giappone 62
CI - Costa d'Avorio 60
CH - Svizzera 56
SN - Senegal 42
BD - Bangladesh 32
NL - Olanda 28
IQ - Iraq 26
AR - Argentina 23
MX - Messico 21
ES - Italia 19
EC - Ecuador 17
PK - Pakistan 17
BE - Belgio 16
NO - Norvegia 15
PL - Polonia 15
CO - Colombia 13
HU - Ungheria 13
IR - Iran 13
JM - Giamaica 13
AT - Austria 12
ZA - Sudafrica 12
AU - Australia 11
SA - Arabia Saudita 11
CR - Costa Rica 10
GR - Grecia 9
ID - Indonesia 9
KE - Kenya 9
BJ - Benin 8
IE - Irlanda 8
MA - Marocco 8
PY - Paraguay 8
JO - Giordania 7
LT - Lituania 7
NI - Nicaragua 7
TN - Tunisia 7
VE - Venezuela 7
CL - Cile 6
IL - Israele 6
OM - Oman 6
PH - Filippine 6
CZ - Repubblica Ceca 5
GT - Guatemala 5
HN - Honduras 5
MY - Malesia 5
PE - Perù 5
TW - Taiwan 5
UZ - Uzbekistan 5
DO - Repubblica Dominicana 4
EG - Egitto 4
LU - Lussemburgo 4
NP - Nepal 4
RO - Romania 4
TT - Trinidad e Tobago 4
UY - Uruguay 4
BO - Bolivia 3
DZ - Algeria 3
HR - Croazia 3
KZ - Kazakistan 3
NG - Nigeria 3
PA - Panama 3
PS - Palestinian Territory 3
AE - Emirati Arabi Uniti 2
BZ - Belize 2
KG - Kirghizistan 2
LV - Lettonia 2
MR - Mauritania 2
PT - Portogallo 2
SV - El Salvador 2
AO - Angola 1
AZ - Azerbaigian 1
BB - Barbados 1
BN - Brunei Darussalam 1
BY - Bielorussia 1
CG - Congo 1
CW - ???statistics.table.value.countryCode.CW??? 1
DK - Danimarca 1
EE - Estonia 1
ET - Etiopia 1
EU - Europa 1
GE - Georgia 1
HT - Haiti 1
Totale 16.690
Città #
Woodbridge 974
Ashburn 798
Singapore 600
Houston 593
Ann Arbor 570
Fairfield 554
Chandler 526
Hong Kong 503
Santa Clara 479
San Jose 466
Milan 371
Serra 346
Beijing 278
Sofia 242
Shanghai 223
Council Bluffs 215
Dallas 214
Cambridge 201
Jacksonville 201
Wilmington 195
Seattle 187
New York 177
Ottawa 153
Hefei 140
Boardman 110
Los Angeles 98
Princeton 98
Izmir 97
Lawrence 92
Seoul 92
Rome 91
Lauterbourg 86
Nanjing 85
Ho Chi Minh City 70
Medford 67
Pisa 62
Abidjan 60
Tokyo 58
São Paulo 52
Dong Ket 48
Buffalo 43
Dakar 42
Bern 40
Dearborn 40
Lancaster 39
Jüchen 37
Nanchang 37
Des Moines 36
Istanbul 36
Munich 36
Hanoi 35
Columbus 33
Redondo Beach 30
San Diego 28
Helsinki 27
Frankfurt am Main 26
Ogden 25
Florence 24
Pune 24
Kunming 23
Redwood City 22
La Spezia 21
Phoenix 21
The Dalles 21
Bremen 20
Chicago 20
Boulder 19
Shenyang 19
Gavorrano 18
Tianjin 18
Bondeno 17
Pomezia 17
Atlanta 15
Hebei 15
Turku 15
Zurich 15
Brussels 14
Fuzhou 14
Rio de Janeiro 14
Monmouth Junction 13
Washington 13
Belo Horizonte 12
Castell'azzara 12
Denver 12
Genoa 12
Changsha 11
Chennai 11
London 11
Baghdad 10
Baltimore 10
Hangzhou 10
Kingston 10
Montreal 10
Stavanger 10
Torino 10
Amsterdam 9
Castagneto Carducci 9
Düsseldorf 9
Guangzhou 9
Mexico City 9
Totale 11.690
Nome #
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks 362
A Continuous Time Physical Graph Based Formulation to Scheduled Service Network Design 250
Joint assignment, scheduling and routing models to Home Care optimization: a pattern based approach 247
Ottimizzazione Robusta 236
Mixed Integer Non-Linear Programming models for Green Network Design 234
Hardness of Robust Network Design 231
Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks 231
A multi-exchange heuristic for the single source capacitated facility location problem 224
A note on the parametric maximum flow problem and some related reoptimization issues 224
Robust asset allocation strategies: relaxed versus classical robustness 223
Delay-constrained shortest paths: approximation algorithms and second-order cone models 222
Energy-efficient resource allocation in wireless LANs under non-linear capacity constraints 214
A modification of Lipski-Preparata's algorithm for the maximum matching problem on bipartite convex graphs 212
Green Design of Wireless Local Area Networks by Multiband Robust Optimization 210
A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem 203
On improving optimal oblivious routing 198
Robust optimisation of green wireless LANs under rate uncertainty and user mobility 198
A strongly polynomial algorithm for the Uniform Balanced Network Flow Problem 197
Increasing the reliability of IEEE 802.11ad for industrial applications 195
Hardness of Robust Network Design 193
A note on Minimum Makespan Assembly Plans 190
Minimum time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights 189
A Multi-exchange Neighborhood for Minimum Makespan Machine Scheduling Problems 184
Static and Dynamic Routing Under Disjoint Dominant Extreme Demands 183
Integrating Energy Management Systems and Renewable Energy Sources in Green Warehouses: The Energy-Aware Green Sequencing and Routing Problem 183
Network Power Management: models and heuristic approaches 182
Demand uncertainty in robust Home Care optimization 181
Energy saving heuristics in Backbone Networks 180
Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques 180
Appunti di Ricerca Operativa 179
Shortest path algorithms in transportation models: classical and innovative aspects 177
Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis 177
Pattern-based decompositions for human resource planning in home health care services 176
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case 176
Sequencing and routing in a large warehouse with high degree of product rotation 174
A note on Cherkasky's algorithm for the maximum flow problem 174
A new dual algorithm for shortest path reoptimization 174
Linear Programming Models for Traffic Engineering in 100% Survivable Networks under combined IS-IS/OSPF and MPLS-TE Protocols 174
Large scale local search heuristics for the Capacitated Vertex p-Center Problem 174
Balanced paths in acyclic networks: tractable cases and related approaches 173
Polynomial Auction Algorithms for Shortest Paths 173
Robust portfolio asset allocation and risk measures 170
Does traffic consolidation always lead to network energy savings? 170
Appunti di Ricerca Operativa 167
Dual algorithms for the shortest path tree problem 167
Optimal Access Point Power Management for Green IEEE 802.11 Networks 167
A note on the parametric maximum flow problem and some related reoptimization issue 166
A new algorithm for reoptimizing shortest paths when the arc costs change 164
Assigning and sequencing storage locations under a two level storage policy: Optimization model and matheuristic approaches 163
Color-coding heuristic approaches for the balanced path problem 161
A fast heuristic approach for the assignment and sequencing storage location problem under a two level storage policy 161
Color-Coding Algorithms to the Balanced Path Problem: Computational Issues 160
Power savings with data rate guarantee in dense WLANs 160
The Cutting Stock Problem: a new model based on hypergraph flows 158
The Skill Vehicle Routing Problem 158
The maximum cut congestion problem 157
Chance Constrained Network Design 154
Distribution network design: new problems and related models 153
Polynomially solvable satisfiability problems 148
A unified algorithmic framework for Max-Flow computations (Toward the design of a combinatorial optimization programming environment) 147
Revisione del volume "Annotated Bibliographies in Combinatorial Optimization" (Dell'Amico, Maffioli, Martello Eds.) 146
Balanced paths in telecommunication networks: some computational results 144
Network power management: Models and heuristic approaches 144
Dynamic Shortest Paths Minimizing Travel Times and Costs 143
Robust Portfolio Asset Allocation: models and algorithmic approaches 142
A note on Dowling-Gallier's Top-Down algorithm for Propositional Horn Satisfiability 142
Flows on Hypergraphs 141
Foreword (dedicated to the memory of Stefano Pallottino) 140
Proceedings of INOC 2009 140
Power Aware Routing and Network Design with Bundled Links 140
Special Issue on the INOC 2009 Conference, April 26 - 29, 2009, Pisa, Italy (Special issue of Networks) 140
The maximum flow problem: a max-preflow approach 140
Home Care optimization: impact of pattern generation policies on scheduling and routing decisions 139
Home Care Services Delivery: Equity Versus Efficiency in Optimization Models 136
An approximation algorithm for computing longest paths 136
Robust green Wireless Local Area Networks: A matheuristic approach 136
Design model of an IEEE 802.11ad infrastructure for TSN-based industrial applications 135
I-READ 4.0: Internet-of-READers for an efficient asset management in large warehouses with high stock rotation index 134
Toward a programming environment for combinatorial optimization: a case study oriented to max-flow computations 131
Addressing consistency and demand uncertainty in the Home Care planning problem 131
Facilities, Locations, Customers:Building blocks of location models. A survey 128
Fast lower bounds for the capacitated minimum spanning tree problem 128
Color-coding algorithms to the balanced path problems: computational issues 126
Pattern Generation Policies to Cope with Robustness in Home Care 124
Towards More Sustainable Logistics: A Review on the Integration of Energy Management Systems and Renewable Energy Sources 120
Strongly polynomial auction algorithms for shortest paths" 120
Augmented patterns for decomposition of scheduling and assignment problems 119
Special Issue In Memory of Stefano Pallottino (Special Issue of Networks ) 119
Proceedings of the 4th International Network Optimization Conference (INOC2009) 118
Directed Hypergraphs as a Modelling Paradigm 118
Editorial 117
Teoria e Metodi di Riottimizzazione per Problemi di Flusso 116
The Hypergraph Simplex Approach: some experimental results 115
Multi-exchange algorithms for the minimum makespan machine scheduling problem 110
A strongly polynomial algorithm for the Balanced network flow problem 109
The Last-Mile Delivery Process with Trucks and Drones Under Uncertain Energy Consumption 109
The Green Sequencing and Routing Problem 107
Maximum Flow Problems and an NP-complete variant on Edge Labeled Graphs 100
Continuous-Time Service Network Design with Stochastic Travel Times 99
Robust portfolio asset allocation and risk measures 97
Totale 16.387
Categoria #
all - tutte 44.624
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 44.624


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022945 0 0 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/20253.061 17 134 31 153 358 280 257 232 269 367 392 571
2025/20263.344 275 414 308 204 296 335 494 178 180 333 140 187
2026/20271.251 95 525 631 0 0 0 0 0 0 0 0 0
Totale 16.884