SPERANZA, Maria Grazia
 Distribuzione geografica
Continente #
NA - Nord America 15.326
EU - Europa 7.327
AS - Asia 3.648
SA - Sud America 52
AF - Africa 27
Continente sconosciuto - Info sul continente non disponibili 20
OC - Oceania 16
Totale 26.416
Nazione #
US - Stati Uniti d'America 15.276
CN - Cina 2.430
UA - Ucraina 1.935
DE - Germania 1.880
RU - Federazione Russa 1.136
IT - Italia 682
HK - Hong Kong 549
FI - Finlandia 421
GB - Regno Unito 323
SG - Singapore 318
IE - Irlanda 311
PL - Polonia 257
FR - Francia 131
IN - India 117
SE - Svezia 74
TR - Turchia 60
BE - Belgio 44
CA - Canada 42
IR - Iran 33
BR - Brasile 29
NL - Olanda 29
VN - Vietnam 26
ID - Indonesia 23
JP - Giappone 23
EU - Europa 20
AT - Austria 18
ES - Italia 18
AU - Australia 15
MU - Mauritius 14
TW - Taiwan 14
CH - Svizzera 13
PT - Portogallo 12
RO - Romania 12
EC - Ecuador 10
MY - Malesia 9
MX - Messico 8
NO - Norvegia 7
PK - Pakistan 7
AE - Emirati Arabi Uniti 6
CL - Cile 6
GE - Georgia 6
GR - Grecia 6
MA - Marocco 5
TH - Thailandia 5
HU - Ungheria 4
GH - Ghana 3
JO - Giordania 3
KR - Corea 3
AZ - Azerbaigian 2
CO - Colombia 2
CZ - Repubblica Ceca 2
DK - Danimarca 2
DZ - Algeria 2
KZ - Kazakistan 2
LV - Lettonia 2
PE - Perù 2
RS - Serbia 2
TN - Tunisia 2
AL - Albania 1
AM - Armenia 1
AR - Argentina 1
BY - Bielorussia 1
FK - Isole Falkland (Malvinas) 1
IL - Israele 1
IQ - Iraq 1
KG - Kirghizistan 1
KH - Cambogia 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
LT - Lituania 1
LU - Lussemburgo 1
ME - Montenegro 1
NZ - Nuova Zelanda 1
OM - Oman 1
PH - Filippine 1
PS - Palestinian Territory 1
SA - Arabia Saudita 1
SD - Sudan 1
SK - Slovacchia (Repubblica Slovacca) 1
TJ - Tagikistan 1
VE - Venezuela 1
Totale 26.416
Città #
Fairfield 2.564
Woodbridge 1.867
Jacksonville 1.393
Houston 1.275
Ann Arbor 1.182
Ashburn 1.068
Ufa 991
Seattle 986
Cambridge 958
Wilmington 911
Chandler 644
Princeton 591
Nanjing 570
Hong Kong 539
Beijing 349
Dublin 311
Brescia 247
Warsaw 244
Nanchang 208
Dearborn 184
Singapore 170
Shenyang 163
Helsinki 162
New York 158
Changsha 134
Hebei 134
Des Moines 131
Jinan 129
San Diego 116
Tianjin 105
Jiaxing 91
Milan 84
Shanghai 57
Hangzhou 56
London 55
Verona 55
Kunming 49
Ningbo 47
Zhengzhou 41
Kocaeli 40
Nürnberg 40
Taizhou 40
Guangzhou 36
Brussels 34
Lanzhou 31
Los Angeles 26
Haikou 25
Lancaster 24
Boardman 23
Norwalk 23
Munich 21
San Francisco 20
Toronto 19
Taiyuan 18
Changchun 16
Rome 16
Fuzhou 15
Orange 14
Vienna 14
Augsburg 13
Dong Ket 13
Padova 12
Redwood City 12
Hanoi 11
Kilburn 11
Hefei 10
Quito 10
Delhi 9
Jakarta 9
Ottawa 9
Macerata 8
Tokyo 8
Bhopal 7
Chiswick 7
Lappeenranta 7
Mainz 7
Qingdao 7
Rende 7
Taipei 7
Ankara 6
Bandung 6
Bologna 6
Campo Limpo Paulista 6
Leuven 6
Modena 6
Providence 6
Chengdu 5
Dalmine 5
Indiana 5
Karachi 5
Molde 5
Nuremberg 5
San Cristóbal de La Laguna 5
Sydney 5
São Paulo 5
Wroclaw 5
Acton 4
Adelsdorf 4
Boston 4
Brienz 4
Totale 19.806
Nome #
A Dynamic Multi-Period Routing Problem 1.078
A heuristic framework for the bi-objective enhanced index tracking problem 276
Linear programming models for portfolio optimization 249
Bridging k-sum and CVaR optimization in MILP 162
The Vehicle Routing Problem with Occasional Drivers 161
Kernel Search for the Capacitated Facility Location Problem 159
Linear and mixed integer programming for portfolio optimization 154
The vehicle routing problem with divisible deliveries and pickups 149
Congestion avoiding heuristic path generation for the proactive route guidance 146
Geometric representation for semi on-line scheduling on uniform processors 144
Intermediate facilities in freight transportation planning: a survey 141
Operations Research in transportation and supply chain management 141
The value of integrating loading and routing 137
Proactive route guidance to avoid congestion 136
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem 133
Kernel Search: A heuristic framework for MILP problems with binary variables 130
Comparison of policies in dynamic routing problems 130
A Column Generation Approach for the Split Delivery Vehicle Routing Problem 128
A branch-and-cut algorithm for a vendor managed inventory routing problem 128
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks 128
A Branch-and-Cut Algorithm for a Vendor Managed Inventory Routing Problem 127
Kernel Search: A new heuristic framework for portfolio selection 124
The Vehicle Routing Problem with Divisible Deliveries and Pickups 124
Analysis of the maximum level policy in a production-distribution system 123
A real-time vehicle routing model for a courier service problem 123
Multi-period Vehicle Routing Problem with Due Dates 123
A kernel search heuristic for the multivehicle inventory routing problem 123
Analysis of the Maximum Level Policy in a Production-Distribution System 122
CORAL: An exact algorithm for the Multidimensional Knapsack Problem 122
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 121
A Hybrid Heuristic for an Inventory-Routing Problem 119
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem 119
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints 119
Optimal solutions for routing problems with profits 118
Hierarchical models for multi-project planning and scheduling 117
The Distance Constrained Multiple Vehicle Traveling Purchaser Problem 117
Twenty years of linear programming based portfolio optimization 117
The minimization of the logistic costs on sequences of links with given shipping frequencies 116
The application of a vehicle routing model to a waste collection problem: two case studies 116
Semi on-line scheduling on two parallel processors with upper bound on the items 116
Modeling the pre-auction stage: the truckload case 116
Investigating the effectiveness of robust portfolio optimization techniques 116
Reoptimizing the rural postman problem 116
Complexity and approximation for Traveling Salesman Problems with profits 116
An ILP-refined tabu search for the directed profitable rural postman problem 116
A decision support system for materials management 115
Scheduling independent tasks with multiple modes 115
To Split or Not to Split: That is the Question 115
Multi-commodity vs. single-commodity routing 115
Conditional value‐at‐risk beyond finance: a survey 115
Semi on-line scheduling on three processors with known sum of the tasks 114
To split or not to split: that is the question 114
Reoptimizing the Traveling Salesman Problem 114
Kernel search: an application to the index tracking problem 114
A survey on two-echelon routing problems 114
A decomposition approach for a resource constrained scheduling problem 113
Minimizing makespan in a multimode multiprocessor shop scheduling problem 113
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 113
Management policies in a dynamic multi-period routing problem 113
A Heuristic for BILP Problems: The Single Source Capacitated Facility Location Problem 113
An iterated local search for the traveling salesman problem with release dates and completion time minimization 113
Exact Solutions to the Double Travelling Salesman Problem with Multiple Stacks 112
Reoptimizing the rural postman problem 112
The split delivery capacitated team orienteering problem 111
Incomplete service and split deliveries in a routing problem with profits 111
Short Term Strategies for a Dynamic Multi-period Routing Problem 110
Short Term Strategies for a Dynamic Multi-Period Routing Problem 110
Vehicle routing problems with split deliveries 110
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks 110
Formulations for an inventory routing problem 110
Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs 110
Inventory Routing Problems: An Introduction 109
The application of a vehicle routing model to a waste-collection problem: two case studies 108
Comparison of policies in dynamic routing problems 108
Complexity and approximation for Traveling Salesman Problems with profits 108
Randomized algorithms: an annotated bibliography 107
The periodic vehicle routing problem with intermediate facilities 107
Vehicle routing in the 1-skip collection problem 107
An ILP-refined tabu search for the directed profitable rural postman problem 107
Multi-commodity vs. single-commodity routing 107
Models and algorithms for the minimization of inventory and transportation costs: a survey 106
Minimization of logistic costs with given frequencies 106
A 13/12 approximation algorithm for bin packing with extendable bins 106
An optimization-based heuristic for the split delivery vehicle routing problem 106
Short Term Strategies for a Dynamic Multi-Period Routing Problem 106
Improved bounds for a semi on-line scheduling problem on two parallel processors 105
A column generation approach for the split delivery vehicle routing problem 105
The team orienteering arc routing problem 105
Reoptimizing the traveling salesman problem 104
An exact approach for portfolio selection with transaction costs and rounds 104
Optimal solutions for routing problems with profits 104
Branch-and-cut algorithms for the split delivery vehicle routing problem 104
A linear programming model for the separate refuse collection service 104
The density function of the number of moves to complete the towers of Hanoi puzzle 103
An overview on the split delivery vehicle routing problem 103
The split delivery vehicle routing problem: a survey 103
Models and simulations for portfolio rebalancing 103
Stochastic control in urban traffic 103
Comparing Sequential and Integrated Approaches for the Production Routing Problem 102
The inventory routing problem: The value of integration 102
Totale 12.977
Categoria #
all - tutte 114.005
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 114.005


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20206.253 0 0 272 957 448 830 788 765 529 963 284 417
2020/20214.166 78 517 143 510 212 457 166 518 648 368 411 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/202590 36 54 0 0 0 0 0 0 0 0 0 0
Totale 27.439