CRIS Current Research Information System

CAPRARA, ALBERTO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.913
AS - Asia 3.638
EU - Europa 3.156
AF - Africa 223
SA - Sud America 171
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 1
Totale 13.110
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.858
SG - Singapore 1.007
VN - Vietnam 1.003
GB - Regno Unito 856
CN - Cina 831
DE - Germania 441
IT - Italia 359
UA - Ucraina 314
SE - Svezia 276
HK - Hong Kong 249
FR - Francia 233
RU - Federazione Russa 188
IN - India 184
NL - Olanda 141
BR - Brasile 115
IE - Irlanda 96
JP - Giappone 90
JO - Giordania 77
ZA - Sudafrica 72
EE - Estonia 61
TG - Togo 58
CI - Costa d'Avorio 43
KR - Corea 34
CA - Canada 32
FI - Finlandia 30
BG - Bulgaria 28
PH - Filippine 27
SC - Seychelles 26
CH - Svizzera 25
AR - Argentina 23
TH - Thailandia 20
PL - Polonia 19
TR - Turchia 19
BD - Bangladesh 18
GR - Grecia 17
BE - Belgio 16
ID - Indonesia 16
AT - Austria 13
MX - Messico 13
PK - Pakistan 11
IQ - Iraq 10
CL - Cile 9
EC - Ecuador 9
ES - Italia 9
AU - Australia 8
HR - Croazia 7
TW - Taiwan 7
KE - Kenya 6
MA - Marocco 5
NG - Nigeria 5
NP - Nepal 5
SI - Slovenia 5
LT - Lituania 4
MY - Malesia 4
PY - Paraguay 4
RO - Romania 4
SA - Arabia Saudita 4
UZ - Uzbekistan 4
VE - Venezuela 4
CO - Colombia 3
CR - Costa Rica 3
HU - Ungheria 3
IL - Israele 3
OM - Oman 3
PE - Perù 3
TN - Tunisia 3
AZ - Azerbaigian 2
CZ - Repubblica Ceca 2
GT - Guatemala 2
IR - Iran 2
LB - Libano 2
LV - Lettonia 2
PT - Portogallo 2
RS - Serbia 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AM - Armenia 1
BA - Bosnia-Erzegovina 1
BF - Burkina Faso 1
BH - Bahrain 1
CM - Camerun 1
DO - Repubblica Dominicana 1
DZ - Algeria 1
EG - Egitto 1
ET - Etiopia 1
HN - Honduras 1
IS - Islanda 1
JM - Giamaica 1
KG - Kirghizistan 1
KW - Kuwait 1
NI - Nicaragua 1
QA - Qatar 1
SK - Slovacchia (Repubblica Slovacca) 1
SR - Suriname 1
SY - Repubblica araba siriana 1
TT - Trinidad e Tobago 1
Totale 13.110
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.230
Southend 748
Singapore 621
Fairfield 550
Ashburn 344
Santa Clara 317
Chandler 294
Dong Ket 285
Wilmington 255
San Jose 243
Woodbridge 232
Hong Kong 231
Seattle 226
Jacksonville 225
Houston 207
Cambridge 201
Princeton 165
Ho Chi Minh City 145
Hanoi 121
Dublin 96
Boardman 95
Beijing 93
Nanjing 89
Turin 84
Hefei 79
Amman 77
Lauterbourg 76
Tokyo 76
Westminster 75
Padova 74
Los Angeles 62
Lomé 58
Frankfurt am Main 48
Abidjan 43
Saint Petersburg 42
Berlin 41
Dallas 41
Jinan 40
Mülheim 39
Buffalo 38
The Dalles 38
Shenyang 33
Medford 32
Milan 32
Nanchang 28
Sofia 28
Changsha 27
Helsinki 27
New York 27
Mahé 25
Hebei 24
Seoul 24
Bologna 22
San Francisco 22
Da Nang 20
Des Moines 20
Guangzhou 20
Norwalk 19
Haiphong 18
Chicago 17
Hangzhou 17
Tianjin 16
San Diego 15
Bern 14
Shanghai 14
Straelen 14
Taizhou 14
Bengaluru 13
Brussels 13
Redondo Beach 13
Redwood City 13
San Venanzo 13
São Paulo 13
Lanzhou 12
Munich 12
Verona 12
Warsaw 12
Olalla 11
Orem 11
Toronto 11
Zhengzhou 11
Falkenstein 10
Haikou 10
Johannesburg 10
Chengdu 9
Dearborn 9
Denver 9
Nuremberg 9
Taiyuan 9
West Lafayette 9
Bangkok 8
Ithaca 8
Jakarta 8
Montreal 8
Moscow 8
Paris 8
Bend 7
Can Tho 7
Chennai 7
Fremont 7
Totale 8.943
Salva come PNG Salva come JPEG
Nome #
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 286
A Column Generation Approach to Train Timetabling in a Corridor 280
A new lower bound for curriculum-based course timetabling 263
A Lagrangian Heuristic for a Train-Unit Assignment Problem 260
Railway Rolling Stock Planning: Robustness Against Large Disruptions 254
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation 250
A Freight Service Design Problem for a Railway Corridor 248
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs 246
Models and Algorithms for the Train Unit Assignment Problem 235
Non-cyclic Train Timetabling and Comparability Graphs 231
An Effective Peak Period Heuristic for Railway Rolling Stock Planning 231
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing 228
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling 228
A Fast Heuristic Algorithm for the Train Unit Assignment Problem 226
Comparison of static vehicle flow assignment methods and micro-simulations for a Personal Rapid Transit network 220
Scheduling Extra Freight Trains on Railway Networks 219
An Efficient Profile-Based Algorithm for Scratchpad Memory Partitioning 216
Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications 214
On integer polytopes with few nonzero vertices 213
An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms 208
Packing into the smallest square: Worst-case analysis of lower bounds 206
A Service Design Problem for a Railway Network 206
An Approximation Scheme for Two-Stage, Two- Dimensional Knapsack 203
Bidimensional packing by bilinear programming 201
Solving a Real-World Train-Unit Assignment Problem 201
Worst-Case Analysis of the Subset Sum Algorithm for Bin Packing 198
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 195
An Application of Network Design with Orientation Constraints 192
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics 192
Recoverable Robustness for Railway Rolling Stock Planning 189
A Study on the Computational Complexity of the Bilevel Knapsack Problem 189
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap 187
Knapsack Problems: A Book Review 185
Bilevel Knapsack with interdiction constraints 185
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation 177
Non-cyclic Train Timetabling and Comparability Graphs 176
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing 175
Solving a Real-World Train Unit Assignment Problem 172
A Complexity and Approximability Study of the Bilevel Knapsack Problem 169
Constrained 0-1 Quadratic Programming: Basic Approaches and Extensions 163
A Heuristic Algorithm for the Train-Unit Assignment Problem 159
A Structural Lemma in 2-Dimensional Packing, and its Implications on Approximability 157
Recovery-Robust Platforming by Network Buffering 156
Delay-Robust Event Scheduling 153
Global Optimization Problems and Domain Reduction Strategies 150
A New Lower Bound for the Minimum Linear Arrangement of a Graph 150
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 150
Solution of the Train Platforming Problem 149
On d-Threshold Graphs and d-Dimensional Bin Packing 149
Optimization Problems in Passenger Railway Systems 147
A branch-and-cut algorithm for multiple sequence alignment 147
11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems 142
Practical solution of periodic filtered approximation as a convex quadratic integer program 142
Packing Cuts in Undirected Graphs 141
Decorous Lower Bounds for Minimum Linear Arrangement 139
Lower Bounds for the Minimum Linear Arrangement of a Graph 135
Robust Train Routing and Online Re-scheduling 133
Optima 128
Solution of the Train Platforming Problem 128
Recoverable Robustness for Scheduling with Precedence Constraints 123
Laying Out Sparse Graphs with Provably Minimum Bandwidth 121
Optima 120
Optimal Linear Arrangements Using Betweenness Variables 120
Modified Subset Sum Algorithms for Bin Packing 117
New Techniques for Cost Sharing in Combinatorial Optimization Games 117
Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation 115
Packing d-Dimensional Bins in d Stages 113
Optima 111
OPTIMA 110
Improved Approximation Algorithms for Multidimensional Bin Packing Problems 110
Computational Combinatorial Optimization: A Book Review 109
OPTIMA 107
Embedding Cuts in a Branch-and-Cut Framework: a Computational Study with {0, 1/2}-Cuts 106
Optima 104
Optima 81
Modeling and solving the crew rostering problem 60
Bilevel Knapsack with interdiction constraints 52
An approximation scheme for the two-stage, two-dimensional bin packing problem 52
Totale 13.220
Salva come PNG Salva come JPEG
Categoria #
all - tutte 31.947
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 31.947
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021422 0 0 0 0 0 0 0 0 0 0 57 365
2021/20222.523 271 33 254 235 293 223 190 232 201 65 271 255
2022/20231.516 182 224 84 158 69 113 60 65 299 26 173 63
2023/2024324 17 72 21 24 32 61 10 20 16 24 8 19
2024/20251.751 53 261 139 130 448 79 110 39 28 134 29 301
2025/20262.834 104 204 349 240 357 226 323 132 579 280 40 0
Totale 13.220