CRIS Current Research Information System

TOTH, PAOLO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 8.565
AS - Asia 5.714
EU - Europa 5.537
AF - Africa 352
SA - Sud America 291
OC - Oceania 19
Continente sconosciuto - Info sul continente non disponibili 1
Totale 20.479
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 8.499
VN - Vietnam 1.793
SG - Singapore 1.493
CN - Cina 1.359
GB - Regno Unito 1.260
IT - Italia 1.123
DE - Germania 873
HK - Hong Kong 479
SE - Svezia 421
UA - Ucraina 377
RU - Federazione Russa 333
FR - Francia 265
NL - Olanda 244
IN - India 243
BR - Brasile 201
IE - Irlanda 160
ZA - Sudafrica 109
EE - Estonia 107
JP - Giappone 97
CI - Costa d'Avorio 91
TG - Togo 78
CH - Svizzera 63
KR - Corea 59
FI - Finlandia 52
JO - Giordania 51
BG - Bulgaria 45
ID - Indonesia 43
AT - Austria 37
CA - Canada 35
SC - Seychelles 34
ES - Italia 31
PL - Polonia 31
AR - Argentina 30
GR - Grecia 25
MX - Messico 23
TR - Turchia 21
BE - Belgio 19
AU - Australia 16
CL - Cile 16
NG - Nigeria 14
PT - Portogallo 13
EC - Ecuador 12
CO - Colombia 11
PE - Perù 10
BD - Bangladesh 9
LB - Libano 9
HR - Croazia 8
IR - Iran 8
RO - Romania 8
CR - Costa Rica 7
LT - Lituania 7
TH - Thailandia 7
LV - Lettonia 6
SI - Slovenia 6
TN - Tunisia 6
CZ - Repubblica Ceca 5
DZ - Algeria 5
VE - Venezuela 5
AE - Emirati Arabi Uniti 4
IL - Israele 4
MA - Marocco 4
MY - Malesia 4
RS - Serbia 4
TW - Taiwan 4
UY - Uruguay 4
BY - Bielorussia 3
EG - Egitto 3
HU - Ungheria 3
IQ - Iraq 3
NO - Norvegia 3
NZ - Nuova Zelanda 3
PK - Pakistan 3
QA - Qatar 3
SA - Arabia Saudita 3
UZ - Uzbekistan 3
ZW - Zimbabwe 3
AL - Albania 2
GE - Georgia 2
ML - Mali 2
NP - Nepal 2
PY - Paraguay 2
RW - Ruanda 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AZ - Azerbaigian 1
DK - Danimarca 1
KE - Kenya 1
KW - Kuwait 1
KZ - Kazakistan 1
LA - Repubblica Popolare Democratica del Laos 1
LI - Liechtenstein 1
LK - Sri Lanka 1
OM - Oman 1
PH - Filippine 1
SK - Slovacchia (Repubblica Slovacca) 1
SV - El Salvador 1
TJ - Tagikistan 1
Totale 20.479
Salva come PNG Salva come JPEG
Città #
Ann Arbor 2.137
Southend 1.083
Singapore 823
Fairfield 661
Ashburn 549
Dong Ket 515
Hong Kong 464
Chandler 424
Wilmington 383
Ho Chi Minh City 372
Woodbridge 370
Seattle 349
Santa Clara 329
Houston 288
Hanoi 278
Jacksonville 266
Cambridge 259
Princeton 246
Bologna 184
Boardman 179
Beijing 164
Dublin 159
Frankfurt am Main 156
Hefei 140
Dallas 127
Nanjing 127
Padova 120
Westminster 113
Milan 104
Abidjan 91
Los Angeles 91
Tokyo 85
Berlin 79
Lomé 78
Jinan 75
Buffalo 67
Turin 64
Shenyang 63
New York 59
Medford 57
Seoul 52
Amman 51
Rome 50
Mülheim 49
Bern 47
Sofia 45
Saint Petersburg 43
San Diego 43
Changsha 42
Des Moines 42
Hebei 41
Nanchang 40
Helsinki 37
Council Bluffs 34
Da Nang 33
Munich 32
Jiaxing 30
São Paulo 30
Chicago 29
Haiphong 29
Mahé 29
Quận Bình Thạnh 29
Guangzhou 28
Shanghai 28
Zhengzhou 28
Redmond 26
Redondo Beach 26
Amsterdam 24
Ninh Bình 24
The Dalles 24
Redwood City 21
Moscow 20
Verona 20
Vienna 20
Norwalk 19
Nuremberg 19
Tianjin 19
Bari 18
Haikou 18
Hangzhou 18
Lanzhou 18
Las Vegas 18
Tappahannock 18
Can Tho 17
Dearborn 17
Ha Long 17
Warsaw 17
Biên Hòa 16
Brussels 16
Fremont 16
Muehltal 15
Taizhou 15
Hải Dương 14
Montreal 14
Ningbo 14
Ravenna 14
Wuhan 14
Abeokuta 13
Dresden 13
Jakarta 13
Totale 13.744
Salva come PNG Salva come JPEG
Nome #
An Electromagnetism Metaheuristic for the Unicost Set Covering Problem 622
Vehicle Routing: Problems, Methods, and Applications 502
A Metaheuristic Approach for the Vertex Coloring Problem 387
On the Optimal Design of Water Distribution Networks: a Practical MINLP Approach 346
An overview of recovery models and algorithms for real-time railway rescheduling 309
A Multistart Heuristic for the Equality Generalized Traveling Salesman Problem 268
Water network design by MINLP 265
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 264
A Column Generation Approach to Train Timetabling in a Corridor 260
An exact approach for the Vertex Coloring Problem 245
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010 241
A new lower bound for curriculum-based course timetabling 240
A Lagrangian Heuristic for a Train-Unit Assignment Problem 236
Algorithms for the Bin Packing Problem with Conflicts 233
Approaches to real world two-dimensional cutting problems 229
A railway timetable rescheduling approach for handling large-scale disruptions 226
A Set-Covering Based Heuristic Approach for Bin-Packing Problems 225
A tutorial on non-periodic train timetabling and platforming problems 224
Recent advances in vehicle routing exact algorithms 224
A Freight Service Design Problem for a Railway Corridor 224
Railway Rolling Stock Planning: Robustness Against Large Disruptions 223
Passenger Railway Optimization 220
Non-cyclic Train Timetabling and Comparability Graphs 218
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs 215
Models and Algorithms for the Train Unit Assignment Problem 212
A Survey on Vertex Coloring Problems 210
An Iterated Local Search Algorithm for the Pollution Traveling Salesman Problem 209
A new ILP-based refinement heuristic for Vehicle Routing Problems 208
A Fast Heuristic Algorithm for the Train Unit Assignment Problem 200
Exact Solution of the Capacitated Vehicle Routing Problem 199
Nominal and Robust Train Timetabling Problems 199
An Effective Peak Period Heuristic for Railway Rolling Stock Planning 199
Models and Heuristic Algorithms for a Weighted Vertex Coloring Problem 196
A Column Generation Heuristic for the Two-Dimensional Cutting Stock Problem with Multiple Stock Size 196
Scheduling Extra Freight Trains on Railway Networks 195
On integer polytopes with few nonzero vertices 194
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times 194
Exact algorithms for routing problems under vehicle capacity constraints 192
A Service Design Problem for a Railway Network 181
Optimizing the Design of Water Distribution Networks Using Mathematical OptimizationCase Studies in Operations Research 180
A three-level framework for performance-based railway timetabling 179
An Evolutionary Approach for Bandwidth Multicoloring Problems 179
Solving a Real-World Train-Unit Assignment Problem 179
Train timetabling by skip-stop planning in highly congested lines 178
A Multi-Start Heuristic Algorithm for the Generalized Traveling Salesman Problem 178
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems 177
An overview of curriculum-based course timetabling 177
Rejoinder on: an overview of curriculum-based course timetabling 176
An MINLP Solution Method for a Water Network Problem 175
Recoverable Robustness for Railway Rolling Stock Planning 170
An ILP Improvement Procedure for the Open Vehicle Routing Problem 170
Robust Train Timetabling 168
Timetable Optimization for High-Speed Trains at Chinese Railways 167
A Heuristic Procedure for the Capacitated m-Ring-Star Problem 166
A metaheuristic framework for Nonlinear Capacitated Covering Problems 165
AIRO 2006 164
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem 162
Metodi Esatti ed Euristici per Problemi di Ottimizzazione 159
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem 158
Non-cyclic Train Timetabling and Comparability Graphs 157
Recent Advances in Vehicle Routing Optimization 156
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem 152
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem 151
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs 150
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems 150
Modelli e Algoritmi per Problemi di Ottimizzazione Combinatoria 149
An Exact Algorithm for the Multitrip Vehicle Routing Problem 148
An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems 148
Solving a Real-World Train Unit Assignment Problem 147
Variable Neighborhood Search for the Cost Constrained Minimum Label Spanning Tree and Label Constrained Minimum Spanning Tree Problems 146
Preface 145
A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem 144
A Heuristic Algorithm for the Train-Unit Assignment Problem 143
The Family of Vehicle Routing Problems 143
Modelli e Algoritmi per Problemi di Ottimizzazione Combinatoria nella Gestione di Sistemi di Trasporto 140
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization 137
Optimization Problems in Passenger Railway Systems 136
Aircraft Sequencing Problems via a Rolling Horizon AlgorithmCombinatorial Optimization 136
Comments on the paper: Routing problems with loading constarints, by Iori and Martello 135
Recovery-Robust Platforming by Network Buffering 134
A metaheuristic approach for the set covering problem 134
On exact solutions for the Minmax Regret Spanning Tree problem 134
Improving on Branch-and-Cut Algorithms for Generalized Minimum Spanning Trees 132
Problemi di "Routing" e "Packing" nell'Ottimizzazione dei Sistemi di Trasporto 130
Solution of the Train Platforming Problem 129
Delay-Robust Event Scheduling 128
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position ShiftingCombinatorial Optimization 127
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem 124
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison 123
The Generalized Covering Salesman Problem 122
Exact approaches for solving robust prize-collecting Steiner tree problems 120
ARRIVAL (Algorithms for Robust and Online Railway Optimization: Improving the Validity and Reliability of Large Scale Systems) FP6-021235-2 118
Exact Methods for the Multi-Trip Vehicle Routing Problem 118
Solution of the Train Platforming Problem 118
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem 115
Robust Train Routing and Online Re-scheduling 115
REORIENT ( (Implementing Change in the European Railway System). TREN-05-FP6TR-S07.42769/513567 114
Guest Editorial to the Feature Cluster “New Trends in Applied Combinatorial Optimization” (EURO/ALIO 2018) 112
Recoverable Robustness for Scheduling with Precedence Constraints 110
An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem 108
Totale 18.535
Salva come PNG Salva come JPEG
Categoria #
all - tutte 51.112
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 51.112
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.203 0 0 0 0 0 122 35 118 149 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/20263.700 556 1.005 614 463 725 337 0 0 0 0 0 0
Totale 20.701