CRIS Current Research Information System

TOTH, PAOLO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 9.269
AS - Asia 7.209
EU - Europa 5.895
AF - Africa 399
SA - Sud America 384
OC - Oceania 22
Continente sconosciuto - Info sul continente non disponibili 2
Totale 23.180
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 9.169
VN - Vietnam 2.594
SG - Singapore 1.661
CN - Cina 1.524
GB - Regno Unito 1.267
IT - Italia 1.194
DE - Germania 911
HK - Hong Kong 501
SE - Svezia 421
FR - Francia 410
UA - Ucraina 385
RU - Federazione Russa 365
IN - India 284
BR - Brasile 253
NL - Olanda 252
IE - Irlanda 164
JP - Giappone 140
ZA - Sudafrica 132
EE - Estonia 107
CI - Costa d'Avorio 91
TG - Togo 78
KR - Corea 70
CH - Svizzera 64
FI - Finlandia 57
ID - Indonesia 55
JO - Giordania 54
CA - Canada 53
BG - Bulgaria 45
ES - Italia 43
AR - Argentina 40
TH - Thailandia 40
BD - Bangladesh 39
PH - Filippine 39
AT - Austria 38
PL - Polonia 36
TR - Turchia 36
SC - Seychelles 34
MX - Messico 32
GR - Grecia 27
CL - Cile 25
TW - Taiwan 25
IQ - Iraq 22
BE - Belgio 21
EC - Ecuador 20
AU - Australia 19
PK - Pakistan 17
CO - Colombia 16
MY - Malesia 15
PT - Portogallo 15
NG - Nigeria 14
TN - Tunisia 14
SA - Arabia Saudita 13
PE - Perù 12
CR - Costa Rica 11
LB - Libano 11
NP - Nepal 11
VE - Venezuela 11
IL - Israele 10
HR - Croazia 9
MA - Marocco 9
RS - Serbia 9
UZ - Uzbekistan 9
CZ - Repubblica Ceca 8
DZ - Algeria 8
IR - Iran 8
RO - Romania 8
LT - Lituania 7
LV - Lettonia 6
SI - Slovenia 6
AE - Emirati Arabi Uniti 4
KE - Kenya 4
QA - Qatar 4
SK - Slovacchia (Repubblica Slovacca) 4
UY - Uruguay 4
AL - Albania 3
AZ - Azerbaigian 3
BY - Bielorussia 3
EG - Egitto 3
GE - Georgia 3
HU - Ungheria 3
KW - Kuwait 3
NO - Norvegia 3
NZ - Nuova Zelanda 3
ZW - Zimbabwe 3
KZ - Kazakistan 2
LK - Sri Lanka 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
BA - Bosnia-Erzegovina 1
BH - Bahrain 1
BO - Bolivia 1
CM - Camerun 1
DK - Danimarca 1
DO - Repubblica Dominicana 1
Totale 23.167
Salva come PNG Salva come JPEG
Città #
Ann Arbor 2.137
Southend 1.083
Singapore 978
Fairfield 661
Ashburn 611
Ho Chi Minh City 581
Dong Ket 515
Hong Kong 472
Hanoi 458
Chandler 424
San Jose 385
Wilmington 383
Woodbridge 370
Seattle 353
Santa Clara 333
Houston 291
Jacksonville 266
Cambridge 259
Princeton 246
Bologna 189
Boardman 182
Frankfurt am Main 170
Beijing 168
Dublin 161
Hefei 141
Nanjing 129
Dallas 128
Lauterbourg 120
Padova 120
Tokyo 114
Westminster 113
Milan 108
Los Angeles 101
Abidjan 91
Berlin 81
Lomé 78
Jinan 75
Da Nang 74
Buffalo 68
Turin 68
New York 66
Shenyang 64
Haiphong 59
Medford 57
Amman 54
Seoul 52
Rome 51
Council Bluffs 50
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 37
Munich 33
Guangzhou 32
Shanghai 32
Chicago 30
Jiaxing 30
Quận Bình Thạnh 30
Mahé 29
Can Tho 28
Zhengzhou 28
Amsterdam 27
Johannesburg 26
Redmond 26
Redondo Beach 26
Ninh Bình 25
Orem 25
Moscow 24
Hangzhou 23
Nuremberg 23
Montreal 21
Redwood City 21
Vienna 21
Bangkok 20
Biên Hòa 20
Ha Long 20
Hải Dương 20
Tianjin 20
Verona 20
Norwalk 19
Warsaw 19
Bari 18
Haikou 18
Lanzhou 18
Las Vegas 18
Tappahannock 18
Brussels 17
Dearborn 17
Bắc Giang 16
Chennai 16
Fremont 16
Naples 16
Totale 15.167
Salva come PNG Salva come JPEG
Nome #
Vehicle Routing: Problems, Methods, and Applications 660
An Electromagnetism Metaheuristic for the Unicost Set Covering Problem 632
A Metaheuristic Approach for the Vertex Coloring Problem 405
On the Optimal Design of Water Distribution Networks: a Practical MINLP Approach 378
An overview of recovery models and algorithms for real-time railway rescheduling 330
A Multistart Heuristic for the Equality Generalized Traveling Salesman Problem 301
Water network design by MINLP 294
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 286
A Column Generation Approach to Train Timetabling in a Corridor 279
An exact approach for the Vertex Coloring Problem 275
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010 265
A new lower bound for curriculum-based course timetabling 263
A Lagrangian Heuristic for a Train-Unit Assignment Problem 260
Approaches to real world two-dimensional cutting problems 258
Railway Rolling Stock Planning: Robustness Against Large Disruptions 251
Algorithms for the Bin Packing Problem with Conflicts 251
A Set-Covering Based Heuristic Approach for Bin-Packing Problems 249
A railway timetable rescheduling approach for handling large-scale disruptions 249
Passenger Railway Optimization 247
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs 246
A tutorial on non-periodic train timetabling and platforming problems 246
A Freight Service Design Problem for a Railway Corridor 246
Recent advances in vehicle routing exact algorithms 241
An Iterated Local Search Algorithm for the Pollution Traveling Salesman Problem 238
Models and Algorithms for the Train Unit Assignment Problem 232
A Survey on Vertex Coloring Problems 232
Non-cyclic Train Timetabling and Comparability Graphs 229
An Effective Peak Period Heuristic for Railway Rolling Stock Planning 229
Exact Solution of the Capacitated Vehicle Routing Problem 228
Exact algorithms for routing problems under vehicle capacity constraints 223
Nominal and Robust Train Timetabling Problems 223
A Column Generation Heuristic for the Two-Dimensional Cutting Stock Problem with Multiple Stock Size 222
A Fast Heuristic Algorithm for the Train Unit Assignment Problem 222
A new ILP-based refinement heuristic for Vehicle Routing Problems 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 214
Scheduling Extra Freight Trains on Railway Networks 214
On integer polytopes with few nonzero vertices 213
Train timetabling by skip-stop planning in highly congested lines 204
A Service Design Problem for a Railway Network 203
A Multi-Start Heuristic Algorithm for the Generalized Traveling Salesman Problem 202
Solving a Real-World Train-Unit Assignment Problem 200
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems 200
An overview of curriculum-based course timetabling 199
An Evolutionary Approach for Bandwidth Multicoloring Problems 198
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems 196
Rejoinder on: an overview of curriculum-based course timetabling 196
A three-level framework for performance-based railway timetabling 195
Optimizing the Design of Water Distribution Networks Using Mathematical OptimizationCase Studies in Operations Research 194
An MINLP Solution Method for a Water Network Problem 192
Recoverable Robustness for Railway Rolling Stock Planning 188
A metaheuristic framework for Nonlinear Capacitated Covering Problems 186
Robust Train Timetabling 185
AIRO 2006 182
An ILP Improvement Procedure for the Open Vehicle Routing Problem 181
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem 181
Timetable Optimization for High-Speed Trains at Chinese Railways 181
Metodi Esatti ed Euristici per Problemi di Ottimizzazione 177
A Heuristic Procedure for the Capacitated m-Ring-Star Problem 175
Non-cyclic Train Timetabling and Comparability Graphs 175
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem 174
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem 173
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem 170
An Exact Algorithm for the Multitrip Vehicle Routing Problem 170
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs 169
Solving a Real-World Train Unit Assignment Problem 168
Recent Advances in Vehicle Routing Optimization 166
A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem 166
An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems 163
Modelli e Algoritmi per Problemi di Ottimizzazione Combinatoria 161
Variable Neighborhood Search for the Cost Constrained Minimum Label Spanning Tree and Label Constrained Minimum Spanning Tree Problems 159
A Heuristic Algorithm for the Train-Unit Assignment Problem 159
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem 158
Aircraft Sequencing Problems via a Rolling Horizon AlgorithmCombinatorial Optimization 158
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position ShiftingCombinatorial Optimization 158
Modelli e Algoritmi per Problemi di Ottimizzazione Combinatoria nella Gestione di Sistemi di Trasporto 157
Preface 157
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization 155
On exact solutions for the Minmax Regret Spanning Tree problem 155
The Family of Vehicle Routing Problems 155
Delay-Robust Event Scheduling 153
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem 152
Recovery-Robust Platforming by Network Buffering 152
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison 151
Problemi di "Routing" e "Packing" nell'Ottimizzazione dei Sistemi di Trasporto 150
Solution of the Train Platforming Problem 148
Exact Methods for the Multi-Trip Vehicle Routing Problem 148
Comments on the paper: Routing problems with loading constarints, by Iori and Martello 148
A metaheuristic approach for the set covering problem 147
Optimization Problems in Passenger Railway Systems 147
Improving on Branch-and-Cut Algorithms for Generalized Minimum Spanning Trees 142
The quadratic knapsack problem with setup 138
The Generalized Covering Salesman Problem 138
Guest Editorial to the Feature Cluster “New Trends in Applied Combinatorial Optimization” (EURO/ALIO 2018) 138
Exact approaches for solving robust prize-collecting Steiner tree problems 136
REORIENT ( (Implementing Change in the European Railway System). TREN-05-FP6TR-S07.42769/513567 133
Robust Train Routing and Online Re-scheduling 133
The quadratic knapsack problem 130
ARRIVAL (Algorithms for Robust and Online Railway Optimization: Improving the Validity and Reliability of Large Scale Systems) FP6-021235-2 130
Discrete Applied Mathematics, Mathematical Software Section 128
Totale 20.752
Salva come PNG Salva come JPEG
Categoria #
all - tutte 55.455
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 55.455
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021779 0 0 0 0 0 0 0 0 0 92 91 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/20266.425 556 1.005 614 463 725 384 675 297 1.234 472 0 0
Totale 23.426