TOTH, PAOLO
 Distribuzione geografica
Continente #
NA - Nord America 9.943
AS - Asia 7.337
EU - Europa 6.139
SA - Sud America 406
AF - Africa 403
Continente sconosciuto - Info sul continente non disponibili 248
OC - Oceania 23
Totale 24.499
Nazione #
US - Stati Uniti d'America 9.811
VN - Vietnam 2.611
SG - Singapore 1.687
CN - Cina 1.547
IT - Italia 1.359
GB - Regno Unito 1.270
DE - Germania 948
HK - Hong Kong 515
SE - Svezia 423
FR - Francia 412
UA - Ucraina 385
RU - Federazione Russa 365
IN - India 291
NL - Olanda 266
BR - Brasile 265
IE - Irlanda 164
JP - Giappone 142
ZA - Sudafrica 132
EE - Estonia 107
CI - Costa d'Avorio 91
TG - Togo 78
KR - Corea 71
CA - Canada 68
CH - Svizzera 66
ID - Indonesia 60
FI - Finlandia 57
BD - Bangladesh 56
JO - Giordania 54
ES - Italia 48
BG - Bulgaria 45
TR - Turchia 45
TH - Thailandia 43
AR - Argentina 41
PH - Filippine 40
AT - Austria 38
PL - Polonia 37
SC - Seychelles 34
MX - Messico 33
CL - Cile 28
GR - Grecia 27
TW - Taiwan 27
BE - Belgio 23
EC - Ecuador 23
IQ - Iraq 22
AU - Australia 20
CO - Colombia 18
PK - Pakistan 17
MY - Malesia 16
PT - Portogallo 16
NG - Nigeria 15
TN - Tunisia 15
SA - Arabia Saudita 13
CR - Costa Rica 12
PE - Perù 12
CZ - Repubblica Ceca 11
LB - Libano 11
NP - Nepal 11
VE - Venezuela 11
IL - Israele 10
DZ - Algeria 9
HR - Croazia 9
MA - Marocco 9
RS - Serbia 9
UZ - Uzbekistan 9
IR - Iran 8
LT - Lituania 8
RO - Romania 8
JM - Giamaica 6
LV - Lettonia 6
NO - Norvegia 6
SI - Slovenia 6
UY - Uruguay 5
AE - Emirati Arabi Uniti 4
GT - Guatemala 4
KE - Kenya 4
QA - Qatar 4
SK - Slovacchia (Repubblica Slovacca) 4
AL - Albania 3
AZ - Azerbaigian 3
BY - Bielorussia 3
EG - Egitto 3
GE - Georgia 3
HU - Ungheria 3
KW - Kuwait 3
NZ - Nuova Zelanda 3
SV - El Salvador 3
ZW - Zimbabwe 3
BA - Bosnia-Erzegovina 2
HN - Honduras 2
KZ - Kazakistan 2
LK - Sri Lanka 2
LY - Libia 2
MD - Moldavia 2
ML - Mali 2
OM - Oman 2
PY - Paraguay 2
RW - Ruanda 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AM - Armenia 1
AO - Angola 1
Totale 24.234
Città #
Ann Arbor 2.137
Southend 1.083
Singapore 997
Fairfield 661
Ashburn 648
Ho Chi Minh City 588
Dong Ket 515
San Jose 504
Hong Kong 484
Hanoi 465
Chandler 424
Wilmington 383
Woodbridge 371
Seattle 354
Santa Clara 350
Houston 298
Jacksonville 267
Cambridge 259
Princeton 246
Bologna 205
Boardman 188
Beijing 179
Frankfurt am Main 176
Council Bluffs 173
Dublin 161
Hefei 141
Milan 141
Dallas 140
Nanjing 129
Lauterbourg 120
Padova 120
Los Angeles 115
Tokyo 115
Westminster 113
Abidjan 91
New York 88
Berlin 81
Lomé 78
Rome 77
Jinan 75
Da Nang 74
Turin 71
Buffalo 70
Shenyang 64
Haiphong 59
Medford 58
Amman 54
Seoul 52
Mülheim 49
The Dalles 49
Bern 47
Sofia 45
Changsha 44
San Diego 44
Saint Petersburg 43
Des Moines 42
Helsinki 42
Hebei 41
Nanchang 40
São Paulo 39
Munich 35
Shanghai 34
Guangzhou 32
Chicago 31
Amsterdam 30
Jiaxing 30
Quận Bình Thạnh 30
Can Tho 29
Mahé 29
Zhengzhou 28
Orem 27
Johannesburg 26
Redmond 26
Redondo Beach 26
Ninh Bình 25
Moscow 24
Plain City 24
Hangzhou 23
Montreal 23
Nuremberg 23
Las Vegas 22
Bangkok 21
Redwood City 21
Verona 21
Vienna 21
Biên Hòa 20
Ha Long 20
Hải Dương 20
Norwalk 20
Tianjin 20
Warsaw 20
Bari 19
Denver 19
Istanbul 19
Haikou 18
Lanzhou 18
Tappahannock 18
Brooklyn 17
Brussels 17
Dearborn 17
Totale 15.710
Nome #
Vehicle Routing: Problems, Methods, and Applications 801
An Electromagnetism Metaheuristic for the Unicost Set Covering Problem 641
A Metaheuristic Approach for the Vertex Coloring Problem 408
On the Optimal Design of Water Distribution Networks: a Practical MINLP Approach 399
An overview of recovery models and algorithms for real-time railway rescheduling 335
A Multistart Heuristic for the Equality Generalized Traveling Salesman Problem 313
Water network design by MINLP 310
A Column Generation Approach to Train Timetabling in a Corridor 292
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 291
An exact approach for the Vertex Coloring Problem 285
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010 275
A new lower bound for curriculum-based course timetabling 266
Approaches to real world two-dimensional cutting problems 265
A Lagrangian Heuristic for a Train-Unit Assignment Problem 263
Algorithms for the Bin Packing Problem with Conflicts 260
Railway Rolling Stock Planning: Robustness Against Large Disruptions 259
A tutorial on non-periodic train timetabling and platforming problems 259
Passenger Railway Optimization 258
A Set-Covering Based Heuristic Approach for Bin-Packing Problems 258
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs 255
A Freight Service Design Problem for a Railway Corridor 253
Recent advances in vehicle routing exact algorithms 250
A railway timetable rescheduling approach for handling large-scale disruptions 250
A Survey on Vertex Coloring Problems 244
Models and Algorithms for the Train Unit Assignment Problem 243
Nominal and Robust Train Timetabling Problems 243
Non-cyclic Train Timetabling and Comparability Graphs 242
An Iterated Local Search Algorithm for the Pollution Traveling Salesman Problem 242
An overview of curriculum-based course timetabling 241
Exact Solution of the Capacitated Vehicle Routing Problem 236
An Effective Peak Period Heuristic for Railway Rolling Stock Planning 236
Scheduling Extra Freight Trains on Railway Networks 230
Exact algorithms for routing problems under vehicle capacity constraints 230
A Column Generation Heuristic for the Two-Dimensional Cutting Stock Problem with Multiple Stock Size 227
A new ILP-based refinement heuristic for Vehicle Routing Problems 226
A Fast Heuristic Algorithm for the Train Unit Assignment Problem 226
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times 222
On integer polytopes with few nonzero vertices 221
Models and Heuristic Algorithms for a Weighted Vertex Coloring Problem 219
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems 214
A Service Design Problem for a Railway Network 211
Solving a Real-World Train-Unit Assignment Problem 209
Train timetabling by skip-stop planning in highly congested lines 207
An Evolutionary Approach for Bandwidth Multicoloring Problems 207
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems 206
A Multi-Start Heuristic Algorithm for the Generalized Traveling Salesman Problem 206
Rejoinder on: an overview of curriculum-based course timetabling 201
An MINLP Solution Method for a Water Network Problem 197
A three-level framework for performance-based railway timetabling 196
Optimizing the Design of Water Distribution Networks Using Mathematical OptimizationCase Studies in Operations Research 195
Recoverable Robustness for Railway Rolling Stock Planning 193
A metaheuristic framework for Nonlinear Capacitated Covering Problems 192
An ILP Improvement Procedure for the Open Vehicle Routing Problem 191
AIRO 2006 189
Robust Train Timetabling 189
Timetable Optimization for High-Speed Trains at Chinese Railways 186
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem 185
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem 182
Metodi Esatti ed Euristici per Problemi di Ottimizzazione 181
Solving a Real-World Train Unit Assignment Problem 178
An Exact Algorithm for the Multitrip Vehicle Routing Problem 178
Recent Advances in Vehicle Routing Optimization 177
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem 177
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem 177
Non-cyclic Train Timetabling and Comparability Graphs 177
A Heuristic Procedure for the Capacitated m-Ring-Star Problem 176
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs 176
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem 173
Modelli e Algoritmi per Problemi di Ottimizzazione Combinatoria 169
A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem 168
Modelli e Algoritmi per Problemi di Ottimizzazione Combinatoria nella Gestione di Sistemi di Trasporto 167
The quadratic knapsack problem 164
Aircraft Sequencing Problems via a Rolling Horizon AlgorithmCombinatorial Optimization 164
Preface 164
An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems 164
Variable Neighborhood Search for the Cost Constrained Minimum Label Spanning Tree and Label Constrained Minimum Spanning Tree Problems 162
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem 161
Recovery-Robust Platforming by Network Buffering 159
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position ShiftingCombinatorial Optimization 159
A Heuristic Algorithm for the Train-Unit Assignment Problem 159
On exact solutions for the Minmax Regret Spanning Tree problem 159
The Family of Vehicle Routing Problems 158
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison 157
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization 157
Solution of the Train Platforming Problem 155
The quadratic knapsack problem with setup 154
Delay-Robust Event Scheduling 154
Problemi di "Routing" e "Packing" nell'Ottimizzazione dei Sistemi di Trasporto 152
A metaheuristic approach for the set covering problem 151
Exact Methods for the Multi-Trip Vehicle Routing Problem 150
Guest Editorial to the Feature Cluster “New Trends in Applied Combinatorial Optimization” (EURO/ALIO 2018) 150
Comments on the paper: Routing problems with loading constarints, by Iori and Martello 149
Improving on Branch-and-Cut Algorithms for Generalized Minimum Spanning Trees 149
Optimization Problems in Passenger Railway Systems 147
The Generalized Covering Salesman Problem 146
Exact approaches for solving robust prize-collecting Steiner tree problems 143
Robust Train Routing and Online Re-scheduling 137
REORIENT ( (Implementing Change in the European Railway System). TREN-05-FP6TR-S07.42769/513567 135
Solution of the Train Platforming Problem 135
ARRIVAL (Algorithms for Robust and Online Railway Optimization: Improving the Validity and Reliability of Large Scale Systems) FP6-021235-2 133
Totale 21.631
Categoria #
all - tutte 61.173
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 61.173


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20223.806 0 82 404 403 526 385 332 385 360 125 444 360
2022/20232.211 241 327 133 248 147 147 93 120 390 40 189 136
2023/2024911 47 103 92 71 98 161 72 63 29 68 39 68
2024/20253.423 122 388 328 307 664 174 218 83 113 228 146 652
2025/20267.112 556 1.005 614 463 725 384 675 297 1.234 572 301 286
2026/2027386 218 168 0 0 0 0 0 0 0 0 0 0
Totale 24.499