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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.659 200 132 276 100 147 152 181 111 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/202517 17 0 0 0 0 0 0 0 0 0 0 0
Totale 9.245