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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20191.669 0 0 0 0 0 0 0 0 0 0 857 812
2019/20207.654 1.169 232 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.523 119 65 170 101 74 203 97 516 1.035 141 2 0
Totale 26.987