CRIS Current Research Information System

TOTH, PAOLO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 9.671
AS - Asia 7.270
EU - Europa 6.078
AF - Africa 401
SA - Sud America 401
OC - Oceania 22
Continente sconosciuto - Info sul continente non disponibili 2
Totale 23.845
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 9.555
VN - Vietnam 2.601
SG - Singapore 1.671
CN - Cina 1.542
IT - Italia 1.316
GB - Regno Unito 1.270
DE - Germania 938
HK - Hong Kong 506
SE - Svezia 422
FR - Francia 411
UA - Ucraina 385
RU - Federazione Russa 365
IN - India 284
NL - Olanda 266
BR - Brasile 262
IE - Irlanda 164
JP - Giappone 141
ZA - Sudafrica 132
EE - Estonia 107
CI - Costa d'Avorio 91
TG - Togo 78
KR - Corea 70
CH - Svizzera 66
CA - Canada 65
ID - Indonesia 58
FI - Finlandia 57
JO - Giordania 54
BD - Bangladesh 51
ES - Italia 46
BG - Bulgaria 45
TR - Turchia 41
AR - Argentina 40
TH - Thailandia 40
PH - Filippine 39
AT - Austria 38
PL - Polonia 37
SC - Seychelles 34
MX - Messico 33
CL - Cile 27
GR - Grecia 27
TW - Taiwan 25
EC - Ecuador 23
IQ - Iraq 22
BE - Belgio 21
AU - Australia 19
CO - Colombia 18
PK - Pakistan 17
MY - Malesia 15
NG - Nigeria 15
PT - Portogallo 15
TN - Tunisia 14
SA - Arabia Saudita 13
PE - Perù 12
CR - Costa Rica 11
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
RO - Romania 8
LT - Lituania 7
LV - Lettonia 6
NO - Norvegia 6
SI - Slovenia 6
UY - Uruguay 5
AE - Emirati Arabi Uniti 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
ZW - Zimbabwe 3
BA - Bosnia-Erzegovina 2
GT - Guatemala 2
HN - Honduras 2
KZ - Kazakistan 2
LK - Sri Lanka 2
MD - Moldavia 2
ML - Mali 2
OM - Oman 2
PY - Paraguay 2
RW - Ruanda 2
SV - El Salvador 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AM - Armenia 1
AO - Angola 1
BH - Bahrain 1
BO - Bolivia 1
Totale 23.830
Salva come PNG Salva come JPEG
Città #
Ann Arbor 2.137
Southend 1.083
Singapore 983
Fairfield 661
Ashburn 632
Ho Chi Minh City 584
Dong Ket 515
San Jose 478
Hong Kong 477
Hanoi 462
Chandler 424
Wilmington 383
Woodbridge 371
Seattle 353
Santa Clara 341
Houston 298
Jacksonville 267
Cambridge 259
Princeton 246
Bologna 203
Boardman 188
Beijing 176
Frankfurt am Main 176
Dublin 161
Hefei 141
Milan 135
Dallas 134
Council Bluffs 132
Nanjing 129
Lauterbourg 120
Padova 120
Tokyo 114
Westminster 113
Los Angeles 110
Abidjan 91
New York 83
Berlin 81
Lomé 78
Jinan 75
Da Nang 74
Rome 73
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 33
Shanghai 33
Guangzhou 32
Amsterdam 30
Chicago 30
Jiaxing 30
Quận Bình Thạnh 30
Mahé 29
Can Tho 28
Zhengzhou 28
Johannesburg 26
Orem 26
Redmond 26
Redondo Beach 26
Ninh Bình 25
Moscow 24
Hangzhou 23
Nuremberg 23
Montreal 22
Las Vegas 21
Redwood City 21
Verona 21
Vienna 21
Bangkok 20
Biên Hòa 20
Ha Long 20
Hải Dương 20
Norwalk 20
Tianjin 20
Warsaw 20
Bari 19
Haikou 18
Lanzhou 18
Tappahannock 18
Brussels 17
Dearborn 17
Denver 17
Naples 17
Brooklyn 16
Bắc Giang 16
Totale 15.535
Salva come PNG Salva come JPEG
Nome #
Vehicle Routing: Problems, Methods, and Applications 739
An Electromagnetism Metaheuristic for the Unicost Set Covering Problem 640
A Metaheuristic Approach for the Vertex Coloring Problem 407
On the Optimal Design of Water Distribution Networks: a Practical MINLP Approach 396
An overview of recovery models and algorithms for real-time railway rescheduling 332
A Multistart Heuristic for the Equality Generalized Traveling Salesman Problem 311
Water network design by MINLP 304
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 290
A Column Generation Approach to Train Timetabling in a Corridor 289
An exact approach for the Vertex Coloring Problem 283
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010 273
A new lower bound for curriculum-based course timetabling 265
Approaches to real world two-dimensional cutting problems 263
A Lagrangian Heuristic for a Train-Unit Assignment Problem 262
Railway Rolling Stock Planning: Robustness Against Large Disruptions 259
Algorithms for the Bin Packing Problem with Conflicts 257
Passenger Railway Optimization 255
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs 254
A tutorial on non-periodic train timetabling and platforming problems 253
A Set-Covering Based Heuristic Approach for Bin-Packing Problems 253
A Freight Service Design Problem for a Railway Corridor 252
A railway timetable rescheduling approach for handling large-scale disruptions 250
Recent advances in vehicle routing exact algorithms 246
Models and Algorithms for the Train Unit Assignment Problem 240
Non-cyclic Train Timetabling and Comparability Graphs 238
An Iterated Local Search Algorithm for the Pollution Traveling Salesman Problem 238
A Survey on Vertex Coloring Problems 237
Nominal and Robust Train Timetabling Problems 233
An Effective Peak Period Heuristic for Railway Rolling Stock Planning 233
Exact Solution of the Capacitated Vehicle Routing Problem 232
Scheduling Extra Freight Trains on Railway Networks 227
Exact algorithms for routing problems under vehicle capacity constraints 227
A Fast Heuristic Algorithm for the Train Unit Assignment Problem 226
A Column Generation Heuristic for the Two-Dimensional Cutting Stock Problem with Multiple Stock Size 225
A new ILP-based refinement heuristic for Vehicle Routing Problems 224
On integer polytopes with few nonzero vertices 219
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times 219
Models and Heuristic Algorithms for a Weighted Vertex Coloring Problem 218
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems 211
A Service Design Problem for a Railway Network 209
Solving a Real-World Train-Unit Assignment Problem 209
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems 204
Train timetabling by skip-stop planning in highly congested lines 204
An Evolutionary Approach for Bandwidth Multicoloring Problems 204
A Multi-Start Heuristic Algorithm for the Generalized Traveling Salesman Problem 203
An overview of curriculum-based course timetabling 200
Rejoinder on: an overview of curriculum-based course timetabling 197
A three-level framework for performance-based railway timetabling 196
An MINLP Solution Method for a Water Network Problem 196
Optimizing the Design of Water Distribution Networks Using Mathematical OptimizationCase Studies in Operations Research 195
Recoverable Robustness for Railway Rolling Stock Planning 191
A metaheuristic framework for Nonlinear Capacitated Covering Problems 191
AIRO 2006 188
An ILP Improvement Procedure for the Open Vehicle Routing Problem 187
Robust Train Timetabling 186
Timetable Optimization for High-Speed Trains at Chinese Railways 185
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem 182
Metodi Esatti ed Euristici per Problemi di Ottimizzazione 179
Non-cyclic Train Timetabling and Comparability Graphs 177
A Heuristic Procedure for the Capacitated m-Ring-Star Problem 176
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem 175
Solving a Real-World Train Unit Assignment Problem 175
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem 175
An Exact Algorithm for the Multitrip Vehicle Routing Problem 175
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs 175
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem 174
Recent Advances in Vehicle Routing Optimization 173
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem 173
A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem 168
Modelli e Algoritmi per Problemi di Ottimizzazione Combinatoria 167
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
Preface 162
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem 161
Modelli e Algoritmi per Problemi di Ottimizzazione Combinatoria nella Gestione di Sistemi di Trasporto 160
Aircraft Sequencing Problems via a Rolling Horizon AlgorithmCombinatorial Optimization 160
A Heuristic Algorithm for the Train-Unit Assignment Problem 159
Recovery-Robust Platforming by Network Buffering 158
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position ShiftingCombinatorial Optimization 158
The Family of Vehicle Routing Problems 158
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison 156
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization 156
Solution of the Train Platforming Problem 155
On exact solutions for the Minmax Regret Spanning Tree problem 155
The quadratic knapsack problem 153
The quadratic knapsack problem with setup 153
Delay-Robust Event Scheduling 153
Problemi di "Routing" e "Packing" nell'Ottimizzazione dei Sistemi di Trasporto 151
A metaheuristic approach for the set covering problem 149
Exact Methods for the Multi-Trip Vehicle Routing Problem 149
Comments on the paper: Routing problems with loading constarints, by Iori and Martello 148
Optimization Problems in Passenger Railway Systems 147
Improving on Branch-and-Cut Algorithms for Generalized Minimum Spanning Trees 147
Guest Editorial to the Feature Cluster “New Trends in Applied Combinatorial Optimization” (EURO/ALIO 2018) 145
The Generalized Covering Salesman Problem 144
Exact approaches for solving robust prize-collecting Steiner tree problems 141
REORIENT ( (Implementing Change in the European Railway System). TREN-05-FP6TR-S07.42769/513567 135
ARRIVAL (Algorithms for Robust and Online Railway Optimization: Improving the Validity and Reliability of Large Scale Systems) FP6-021235-2 133
Robust Train Routing and Online Re-scheduling 133
Discrete Applied Mathematics, Mathematical Software Section 132
Totale 21.306
Salva come PNG Salva come JPEG
Categoria #
all - tutte 58.919
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 58.919
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021596 0 0 0 0 0 0 0 0 0 0 0 596
2021/20224.190 384 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.090 556 1.005 614 463 725 384 675 297 1.234 572 301 264
Totale 24.091