WOLFLER CALVO, ROBERTO
 Distribuzione geografica
Continente #
EU - Europa 99.114
NA - Nord America 1.693
AS - Asia 312
SA - Sud America 4
Totale 101.123
Nazione #
IT - Italia 98.724
US - Stati Uniti d'America 1.675
SE - Svezia 231
CN - Cina 201
SG - Singapore 87
UA - Ucraina 70
GB - Regno Unito 26
DE - Germania 19
CA - Canada 18
FI - Finlandia 18
FR - Francia 18
VN - Vietnam 8
TW - Taiwan 6
IN - India 3
BR - Brasile 2
IE - Irlanda 2
IR - Iran 2
JP - Giappone 2
KR - Corea 2
PL - Polonia 2
AT - Austria 1
CL - Cile 1
ES - Italia 1
NO - Norvegia 1
PE - Perù 1
SI - Slovenia 1
TR - Turchia 1
Totale 101.123
Città #
Cagliari 97.490
Uta 1.214
Fairfield 391
Nyköping 182
Ashburn 161
Woodbridge 156
Wilmington 140
Houston 139
Seattle 138
Cambridge 114
Boardman 101
Beijing 46
Singapore 46
Dearborn 42
Santa Clara 40
Boston 39
Nanjing 39
Jacksonville 35
Ann Arbor 33
Shanghai 24
San Diego 21
Helsinki 18
Hebei 16
Toronto 16
Shenyang 11
Paris 10
Orange 9
Dong Ket 8
London 8
Milan 8
Mountain View 8
Redwood City 8
Nanchang 7
Changsha 6
Guangzhou 5
Kunming 5
Norwalk 5
Tianjin 5
Taipei 4
Dortmund 3
Jiaxing 3
Zhengzhou 3
Karlsruhe 2
Mumbai 2
Phoenix 2
Rockville 2
Shenzhen 2
Southampton 2
Spirit Lake 2
Walnut 2
Wandsworth 2
Whitechapel 2
Acton 1
Bangalore 1
Barnstaple 1
Belfort 1
Bologna 1
Borås 1
Carrara 1
Cergy 1
Chicago 1
Chongqing 1
College Park 1
Dresden 1
Dublin 1
Elk Grove Village 1
Fuzhou 1
Greenbelt 1
Hamburg 1
Hangzhou 1
Harbin 1
Hefei 1
Hounslow 1
Isfahan 1
Jiangmen 1
Jinan 1
Lequile 1
Lima 1
Liverpool 1
Ljubljana 1
Longyan 1
Ludwigshafen 1
Madrid 1
Montreal 1
Montréal 1
Munich 1
Nanning 1
Pohang 1
Prescot 1
Pusan 1
Putian 1
San Jose 1
Santiago 1
Speyer 1
Stuttgart 1
Tokyo 1
Trondheim 1
Tuscaloosa 1
Xian 1
Totale 100.824
Nome #
An efficient heuristic approach to solve the unate covering problem 50.052
New lower bounds and exact method for the m-PVRP 17.191
Solving the Capacitated Location Routing Problem by a Cooperative Lagrangean Relaxation - Granular Tabu Search Heuristic 4.332
An effective memetic algorithm for the cumulative capacitated vehicle routing problem 1.492
A distributed geographic information system for the daily car pooling problem 1.469
The static bicycle relocation problem with demand intervals 1.465
Solving the electricity production planning problem by a column generation based heuristic 1.460
Lower and upper bounds for the m-peripatetic vehicle routing problem 1.345
A Granular Tabu Search algorithm for the Dial-a-Ride Problem 1.277
STEEDS: A strategic transport-energy-environment decision support 999
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks 955
An analytical approach to calculate the capacity of a railway system 897
Use of Neural Networks to Estimate the Number of Nodes of an Edge Quadtree 870
A new effective unified model for solving the Pre-marshalling and Block Relocation Problems 862
A column generation based heuristic for the multicommodity-ring vehicle routing problem 830
The Vehicle Routing Problem with Transhipment Facilities 797
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows 788
A Branch-and-Cut method for the Capacitated Location-Routing Problem 784
An exact algorithm for the two-echelon capacitated vehicle routing problem 780
Preface: Special issue on freight transportation and logistics 770
The multicommodity-ring location routing problem 765
The multiple vehicle balancing problem 751
An exact algorithm for the static rebalancing problem arising in bicycle sharing systems 726
Solving the Capacitated location-Routing Problem by a GRASP complemented by a Learning Process and a Path Relinking 713
Bike sharing systems: Solving the static rebalancing problem 704
Shared mobility systems 697
An effective and fast heuristic for the Dial-a-Ride problem 691
A new heuristic for the Traveling Salesman Problem with Time Windows 681
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem 646
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search 638
A heuristic approach to the overnight security service problem 621
Metaheuristics for logistics and vehicle routing 606
An exact method for the capacitated location-routing problem 604
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem 595
A Heuristic Algorithm to solve Location-Routing Problem with Non-Linear Cost Functions 566
A heuristic for the vehicle routing problem with time windows 548
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints 474
A branch and price approach for the Split Pickup and Split Delivery VRP 367
The Schrijver system of the flow cone in series-parallel graphs 203
null 154
Hard problems on box-totally dual integral polyhedra 83
null 26
null 11
Totale 101.285
Categoria #
all - tutte 113.369
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 113.369


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.315 0 0 0 0 225 199 148 161 169 114 138 161
2020/20213.964 233 242 337 497 396 658 657 403 20 30 114 377
2021/20222.925 102 105 235 117 105 283 358 136 256 193 347 688
2022/20236.154 399 643 490 546 459 681 385 560 336 572 675 408
2023/20245.255 232 248 227 309 573 966 799 379 160 379 505 478
2024/202580.602 30.563 14.285 34.026 1.202 526 0 0 0 0 0 0 0
Totale 101.285