SPERANZA, Maria Grazia
 Distribuzione geografica
Continente #
NA - Nord America 19.480
AS - Asia 9.653
EU - Europa 8.909
SA - Sud America 1.930
AF - Africa 244
OC - Oceania 33
Continente sconosciuto - Info sul continente non disponibili 22
Totale 40.271
Nazione #
US - Stati Uniti d'America 19.223
CN - Cina 3.574
SG - Singapore 2.981
DE - Germania 1.983
UA - Ucraina 1.963
BR - Brasile 1.619
RU - Federazione Russa 1.431
HK - Hong Kong 1.107
IT - Italia 1.074
VN - Vietnam 531
FI - Finlandia 469
FR - Francia 465
GB - Regno Unito 435
TR - Turchia 367
IE - Irlanda 318
IN - India 304
PL - Polonia 290
BD - Bangladesh 176
CA - Canada 129
ID - Indonesia 127
AR - Argentina 116
SE - Svezia 102
MX - Messico 73
IQ - Iraq 71
ES - Italia 68
NL - Olanda 63
BE - Belgio 59
ZA - Sudafrica 59
EC - Ecuador 58
JP - Giappone 54
NG - Nigeria 47
IR - Iran 41
MA - Marocco 38
PK - Pakistan 36
SA - Arabia Saudita 36
VE - Venezuela 35
TW - Taiwan 32
AU - Australia 31
AT - Austria 30
UZ - Uzbekistan 28
PY - Paraguay 26
CL - Cile 24
CO - Colombia 22
PT - Portogallo 22
CH - Svizzera 20
EU - Europa 20
PH - Filippine 20
AE - Emirati Arabi Uniti 19
AZ - Azerbaigian 19
KE - Kenya 18
RO - Romania 18
DZ - Algeria 17
EG - Egitto 17
MY - Malesia 17
DK - Danimarca 15
JO - Giordania 15
MU - Mauritius 15
TN - Tunisia 14
IL - Israele 12
JM - Giamaica 12
LT - Lituania 12
PE - Perù 12
UY - Uruguay 12
KZ - Kazakistan 10
NO - Norvegia 10
TH - Thailandia 10
GR - Grecia 9
HU - Ungheria 9
CZ - Repubblica Ceca 8
GE - Georgia 8
LB - Libano 8
PA - Panama 7
BG - Bulgaria 6
BH - Bahrain 6
KR - Corea 6
OM - Oman 6
TT - Trinidad e Tobago 6
CR - Costa Rica 5
HN - Honduras 5
KG - Kirghizistan 5
PS - Palestinian Territory 5
SK - Slovacchia (Repubblica Slovacca) 5
AL - Albania 4
BB - Barbados 4
LK - Sri Lanka 4
LY - Libia 4
NP - Nepal 4
SV - El Salvador 4
AM - Armenia 3
BO - Bolivia 3
DO - Repubblica Dominicana 3
ET - Etiopia 3
GH - Ghana 3
GT - Guatemala 3
LV - Lettonia 3
MD - Moldavia 3
BA - Bosnia-Erzegovina 2
BY - Bielorussia 2
GY - Guiana 2
HR - Croazia 2
Totale 40.231
Città #
Fairfield 2.564
Woodbridge 1.867
Singapore 1.558
Ashburn 1.432
Jacksonville 1.398
Houston 1.283
Ann Arbor 1.182
Hong Kong 1.083
Seattle 999
Ufa 991
Cambridge 959
Wilmington 915
Chandler 644
The Dalles 627
Beijing 610
San Jose 592
Princeton 591
Nanjing 573
Dublin 316
New York 298
Lauterbourg 280
Brescia 278
Istanbul 275
Warsaw 275
Los Angeles 260
Nanchang 209
Helsinki 195
Ho Chi Minh City 194
Dearborn 184
Milan 166
Shenyang 164
Changsha 148
Buffalo 135
Des Moines 135
Hebei 134
Jinan 133
Hanoi 130
Moscow 128
São Paulo 128
San Diego 119
Tianjin 118
Jiaxing 94
Dallas 91
Redondo Beach 87
London 78
Shanghai 74
Hangzhou 65
Chicago 63
Council Bluffs 61
Guangzhou 60
San Francisco 59
Munich 56
Verona 56
Santa Clara 54
Kunming 49
Ningbo 48
Orem 48
Belo Horizonte 47
Zhengzhou 46
Rio de Janeiro 45
Chennai 44
Abuja 42
Rome 41
Taizhou 41
Atlanta 40
Kocaeli 40
Nürnberg 40
Brussels 38
Jakarta 37
Toronto 36
Naples 33
Brooklyn 31
Lanzhou 31
Phoenix 31
Tokyo 31
Brasília 28
Montreal 28
Mexico City 27
Porto Alegre 27
Boardman 26
Haikou 26
Lancaster 26
Quito 26
Curitiba 24
Johannesburg 24
Baghdad 23
Boston 23
Buenos Aires 23
Frankfurt am Main 23
Norwalk 23
Vienna 23
Stockholm 22
Tashkent 22
Bandung 21
Denver 21
Dhaka 20
New Delhi 20
Nuremberg 20
Amsterdam 19
Campinas 19
Totale 26.591
Nome #
A Dynamic Multi-Period Routing Problem 1.113
Linear programming models for portfolio optimization 510
A heuristic framework for the bi-objective enhanced index tracking problem 356
Kernel Search: A heuristic framework for MILP problems with binary variables 239
Bridging k-sum and CVaR optimization in MILP 206
A Column Generation Approach for the Split Delivery Vehicle Routing Problem 205
A branch-and-cut algorithm for a vendor managed inventory routing problem 205
The Vehicle Routing Problem with Occasional Drivers 201
The vehicle routing problem with divisible deliveries and pickups 200
Operations Research in transportation and supply chain management 198
A Branch-and-Cut Algorithm for a Vendor Managed Inventory Routing Problem 197
Congestion avoiding heuristic path generation for the proactive route guidance 197
Proactive route guidance to avoid congestion 194
A branch-and-cut algorithm for the orienteering arc routing problem 193
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints 193
Kernel Search for the Capacitated Facility Location Problem 192
A Hybrid Heuristic for an Inventory-Routing Problem 190
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks 190
Comparing Sequential and Integrated Approaches for the Production Routing Problem 188
A survey on two-echelon routing problems 188
Linear and mixed integer programming for portfolio optimization 186
Comparison of policies in dynamic routing problems 183
Intermediate facilities in freight transportation planning: a survey 182
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem 180
Conditional value‐at‐risk beyond finance: a survey 180
Geometric representation for semi on-line scheduling on uniform processors 179
A real-time vehicle routing model for a courier service problem 179
A kernel search heuristic for the multivehicle inventory routing problem 178
Management policies in a dynamic multi-period routing problem 177
The value of integrating loading and routing 176
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 175
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks 175
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem 175
Analysis of the Maximum Level Policy in a Production-Distribution System 174
On single-source capacitated facility location with cost and fairness objectives 174
A Heuristic for BILP Problems: The Single Source Capacitated Facility Location Problem 173
Kernel Search: A new heuristic framework for portfolio selection 172
Short Term Strategies for a Dynamic Multi-Period Routing Problem 171
Optimal solutions for routing problems with profits 169
Formulations for an inventory routing problem 169
Modeling the pre-auction stage: the truckload case 167
Branch-and-cut algorithms for the split delivery vehicle routing problem 167
Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs 167
A comparison of Mad and CVaR with side constraints 166
CORAL: An exact algorithm for the Multidimensional Knapsack Problem 165
An ILP-refined tabu search for the directed profitable rural postman problem 165
A decision support system for materials management 164
Investigating the effectiveness of robust portfolio optimization techniques 164
Optimal solutions for routing problems with profits 164
A 13/12 approximation algorithm for bin packing with extendable bins 162
Short Term Strategies for a Dynamic Multi-Period Routing Problem 162
Incomplete service and split deliveries in a routing problem with profits 161
Multi-commodity vs. single-commodity routing 161
Analysis of the maximum level policy in a production-distribution system 160
Reoptimizing the traveling salesman problem 160
Comparison of policies in dynamic routing problems 160
Twenty years of linear programming based portfolio optimization 160
An ILP-refined tabu search for the directed profitable rural postman problem 159
Reoptimizing the rural postman problem 159
Incomplete service and split deliveries in a routing problem with profits 159
Reoptimizing the Traveling Salesman Problem 158
Kernel search: an application to the index tracking problem 157
The Vehicle Routing Problem with Divisible Deliveries and Pickups 156
Short Term Strategies for a Dynamic Multi-period Routing Problem 155
The application of a vehicle routing model to a waste collection problem: two case studies 154
An iterated local search for the traveling salesman problem with release dates and completion time minimization 154
Methodology for data processing for road accidents that involve vulnerable road users. The case of Brescia 154
A linear programming model for the separate refuse collection service 154
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 153
A matheuristic for the multi-vehicle inventory routing problem 153
A branch-and-cut algorithm for the Team Orienteering Problem 153
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 152
To Split or Not to Split: That is the Question 152
Inventory Routing Problems: An Introduction 152
The split delivery capacitated team orienteering problem 151
Exact Solutions to the Double Travelling Salesman Problem with Multiple Stacks 150
Hierarchical models for multi-project planning and scheduling 149
Improved bounds for a semi on-line scheduling problem on two parallel processors 149
A hybrid heuristic for an inventory-routing problem 149
A column generation approach for the split delivery vehicle routing problem 149
Multi-period Vehicle Routing Problem with Due Dates 149
A decision support system for operational production scheduling 148
Minimizing makespan in a multimode multiprocessor shop scheduling problem 148
The minimization of the logistic costs on sequences of links with given shipping frequencies 147
An exact approach for portfolio selection with transaction costs and rounds 147
To split or not to split: that is the question 146
On the collaboration uncapacitated arc routing problem 146
The team orienteering arc routing problem 146
Vehicle routing in the 1-skip collection problem 145
A decomposition approach for a resource constrained scheduling problem 144
Scheduling independent tasks with multiple modes 144
The Capacitated Team Orienteering and Profitable Tour Problems 144
Complexity and approximation for Traveling Salesman Problems with profits 144
Complexity and approximation for Traveling Salesman Problems with profits 144
Semi on-line scheduling on three processors with known sum of the tasks 143
The team orienteering arc routing problem 143
A hierarchical multiobjective approach to projectmanagement 143
A comparison of MAD and CVaR with side constraints 142
Semi on-line scheduling on two parallel processors with upper bound on the items 142
The Distance Constrained Multiple Vehicle Traveling Purchaser Problem 142
Totale 18.085
Categoria #
all - tutte 181.221
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 181.221


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021138 0 0 0 0 0 0 0 0 0 0 0 138
2021/20222.305 151 462 68 82 40 132 149 219 123 256 170 453
2022/20232.033 332 19 25 179 181 537 21 219 311 16 78 115
2023/20242.885 119 65 170 101 74 203 97 516 1.035 141 42 322
2024/20254.749 36 54 48 506 647 412 529 159 481 322 1.014 541
2025/20269.206 900 1.311 810 1.529 724 408 1.228 391 717 696 352 140
Totale 41.304