WOLFLER CALVO, ROBERTO
 Distribuzione geografica
Continente #
EU - Europa 18.129
NA - Nord America 1.572
AS - Asia 217
SA - Sud America 4
Totale 19.922
Nazione #
IT - Italia 17.748
US - Stati Uniti d'America 1.554
SE - Svezia 231
CN - Cina 163
UA - Ucraina 70
SG - Singapore 30
GB - Regno Unito 22
CA - Canada 18
DE - Germania 18
FR - Francia 18
FI - Finlandia 15
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
CL - Cile 1
ES - Italia 1
NO - Norvegia 1
PE - Perù 1
SI - Slovenia 1
TR - Turchia 1
Totale 19.922
Città #
Cagliari 17.732
Fairfield 391
Nyköping 182
Ashburn 161
Woodbridge 156
Wilmington 140
Houston 139
Seattle 138
Cambridge 114
Beijing 45
Dearborn 42
Boston 39
Nanjing 39
Jacksonville 35
Ann Arbor 33
Boardman 21
San Diego 21
Hebei 16
Toronto 16
Helsinki 15
Shenyang 11
Paris 10
Orange 9
Dong Ket 8
London 8
Milan 8
Mountain View 8
Redwood City 8
Nanchang 7
Changsha 6
Kunming 5
Norwalk 5
Tianjin 5
Guangzhou 4
Shanghai 4
Taipei 4
Dortmund 3
Jiaxing 3
Zhengzhou 3
Karlsruhe 2
Mumbai 2
Phoenix 2
Rockville 2
Singapore 2
Spirit Lake 2
Walnut 2
Wandsworth 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
Fuzhou 1
Greenbelt 1
Hamburg 1
Hangzhou 1
Harbin 1
Hefei 1
Hounslow 1
Isfahan 1
Jinan 1
Lequile 1
Lima 1
Liverpool 1
Ljubljana 1
Ludwigshafen 1
Madrid 1
Montreal 1
Montréal 1
Nanning 1
Pohang 1
Prescot 1
Pusan 1
San Jose 1
Santiago 1
Speyer 1
Stuttgart 1
Tokyo 1
Trondheim 1
Tuscaloosa 1
Xian 1
Totale 19.652
Nome #
A new effective unified model for solving the Pre-marshalling and Block Relocation Problems 730
A column generation based heuristic for the multicommodity-ring vehicle routing problem 644
An effective memetic algorithm for the cumulative capacitated vehicle routing problem 627
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows 624
The multiple vehicle balancing problem 618
A Branch-and-Cut method for the Capacitated Location-Routing Problem 606
Solving the Capacitated location-Routing Problem by a GRASP complemented by a Learning Process and a Path Relinking 599
An exact algorithm for the static rebalancing problem arising in bicycle sharing systems 583
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks 581
New lower bounds and exact method for the m-PVRP 579
An effective and fast heuristic for the Dial-a-Ride problem 567
The multicommodity-ring location routing problem 558
A new heuristic for the Traveling Salesman Problem with Time Windows 556
Use of Neural Networks to Estimate the Number of Nodes of an Edge Quadtree 553
An exact algorithm for the two-echelon capacitated vehicle routing problem 551
Bike sharing systems: Solving the static rebalancing problem 550
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search 542
A Granular Tabu Search algorithm for the Dial-a-Ride Problem 532
The static bicycle relocation problem with demand intervals 532
Solving the electricity production planning problem by a column generation based heuristic 531
STEEDS: A strategic transport-energy-environment decision support 530
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem 529
An exact method for the capacitated location-routing problem 506
The Vehicle Routing Problem with Transhipment Facilities 493
Metaheuristics for logistics and vehicle routing 489
Lower and upper bounds for the m-peripatetic vehicle routing problem 485
Solving the Capacitated Location Routing Problem by a Cooperative Lagrangean Relaxation - Granular Tabu Search Heuristic 471
Shared mobility systems 469
An efficient heuristic approach to solve the unate covering problem 469
A distributed geographic information system for the daily car pooling problem 465
A Heuristic Algorithm to solve Location-Routing Problem with Non-Linear Cost Functions 464
A heuristic for the vehicle routing problem with time windows 462
Preface: Special issue on freight transportation and logistics 437
An analytical approach to calculate the capacity of a railway system 434
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem 410
A heuristic approach to the overnight security service problem 400
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints 364
A branch and price approach for the Split Pickup and Split Delivery VRP 258
null 154
The Schrijver system of the flow cone in series-parallel graphs 94
null 26
null 11
Totale 20.083
Categoria #
all - tutte 30.295
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 30.295


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019224 0 0 0 0 0 0 0 0 0 0 135 89
2019/20201.694 119 62 31 167 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/20244.655 232 248 227 309 573 966 799 379 160 379 383 0
Totale 20.083