CRIS Current Research Information System

CAPRARA, ALBERTO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.164
AS - Asia 3.708
EU - Europa 3.215
AF - Africa 225
SA - Sud America 178
Continente sconosciuto - Info sul continente non disponibili 111
OC - Oceania 9
Totale 13.610
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.097
SG - Singapore 1.019
VN - Vietnam 1.007
GB - Regno Unito 856
CN - Cina 838
DE - Germania 441
IT - Italia 412
UA - Ucraina 314
SE - Svezia 276
HK - Hong Kong 252
FR - Francia 233
RU - Federazione Russa 189
IN - India 184
NL - Olanda 142
BR - Brasile 120
IE - Irlanda 96
JP - Giappone 90
JO - Giordania 77
ZA - Sudafrica 72
BD - Bangladesh 62
EE - Estonia 61
TG - Togo 58
CI - Costa d'Avorio 43
CA - Canada 35
KR - Corea 34
FI - Finlandia 30
BG - Bulgaria 28
CH - Svizzera 27
PH - Filippine 27
SC - Seychelles 26
AR - Argentina 23
TH - Thailandia 20
PL - Polonia 19
TR - Turchia 19
GR - Grecia 17
BE - Belgio 16
ID - Indonesia 16
MX - Messico 15
AT - Austria 13
PK - Pakistan 11
ES - Italia 10
IQ - Iraq 10
AU - Australia 9
CL - Cile 9
EC - Ecuador 9
HR - Croazia 7
MA - Marocco 7
TW - Taiwan 7
KE - Kenya 6
CO - Colombia 5
NG - Nigeria 5
NP - Nepal 5
SI - Slovenia 5
CR - Costa Rica 4
LT - Lituania 4
MY - Malesia 4
PY - Paraguay 4
RO - Romania 4
SA - Arabia Saudita 4
UZ - Uzbekistan 4
VE - Venezuela 4
GT - Guatemala 3
HU - Ungheria 3
IL - Israele 3
OM - Oman 3
PE - Perù 3
TN - Tunisia 3
AZ - Azerbaigian 2
CZ - Repubblica Ceca 2
IR - Iran 2
JM - Giamaica 2
LB - Libano 2
LV - Lettonia 2
NI - Nicaragua 2
PT - Portogallo 2
RS - Serbia 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AM - Armenia 1
BA - Bosnia-Erzegovina 1
BB - Barbados 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
KG - Kirghizistan 1
KW - Kuwait 1
KY - Cayman, isole 1
MD - Moldavia 1
PA - Panama 1
QA - Qatar 1
SK - Slovacchia (Repubblica Slovacca) 1
SR - Suriname 1
SY - Repubblica araba siriana 1
TT - Trinidad e Tobago 1
Totale 13.500
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.230
Southend 748
Singapore 632
Fairfield 550
Ashburn 351
Santa Clara 327
Chandler 294
San Jose 287
Dong Ket 285
Wilmington 256
Hong Kong 234
Woodbridge 232
Seattle 226
Jacksonville 225
Houston 207
Cambridge 201
Princeton 165
Ho Chi Minh City 145
Hanoi 123
Boardman 96
Dublin 96
Beijing 95
Nanjing 89
Turin 87
Hefei 79
Council Bluffs 78
Amman 77
Lauterbourg 76
Tokyo 76
Westminster 75
Padova 74
Los Angeles 66
Lomé 58
Milan 50
Frankfurt am Main 48
Dallas 45
Abidjan 43
Saint Petersburg 42
Berlin 41
Buffalo 41
Jinan 40
Mülheim 39
The Dalles 38
Medford 33
Shenyang 33
New York 30
Nanchang 28
Sofia 28
Changsha 27
Helsinki 27
Bologna 25
Mahé 25
Hebei 24
Seoul 24
San Francisco 23
Chicago 22
Da Nang 20
Des Moines 20
Guangzhou 20
Norwalk 19
Rome 19
Haiphong 18
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
Phoenix 9
Plain City 9
Taiyuan 9
West Lafayette 9
Bangkok 8
Brooklyn 8
Ithaca 8
Jakarta 8
Montreal 8
Moscow 8
Totale 9.156
Salva come PNG Salva come JPEG
Nome #
A Column Generation Approach to Train Timetabling in a Corridor 292
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 291
A new lower bound for curriculum-based course timetabling 266
A Lagrangian Heuristic for a Train-Unit Assignment Problem 263
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation 260
Railway Rolling Stock Planning: Robustness Against Large Disruptions 259
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs 255
A Freight Service Design Problem for a Railway Corridor 253
Non-cyclic Train Timetabling and Comparability Graphs 242
Models and Algorithms for the Train Unit Assignment Problem 242
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling 239
An Effective Peak Period Heuristic for Railway Rolling Stock Planning 236
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing 230
Scheduling Extra Freight Trains on Railway Networks 230
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 225
On integer polytopes with few nonzero vertices 221
Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications 220
An Efficient Profile-Based Algorithm for Scratchpad Memory Partitioning 219
Bidimensional packing by bilinear programming 212
An Approximation Scheme for Two-Stage, Two- Dimensional Knapsack 210
A Service Design Problem for a Railway Network 210
An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms 209
Solving a Real-World Train-Unit Assignment Problem 209
Packing into the smallest square: Worst-case analysis of lower bounds 208
Worst-Case Analysis of the Subset Sum Algorithm for Bin Packing 201
An Application of Network Design with Orientation Constraints 198
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 195
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics 194
Recoverable Robustness for Railway Rolling Stock Planning 193
A Study on the Computational Complexity of the Bilevel Knapsack Problem 190
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap 189
Packing Cuts in Undirected Graphs 189
Bilevel Knapsack with interdiction constraints 188
Knapsack Problems: A Book Review 187
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing 184
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation 181
Solving a Real-World Train Unit Assignment Problem 178
Non-cyclic Train Timetabling and Comparability Graphs 177
A Complexity and Approximability Study of the Bilevel Knapsack Problem 174
Constrained 0-1 Quadratic Programming: Basic Approaches and Extensions 168
A New Lower Bound for the Minimum Linear Arrangement of a Graph 164
On d-Threshold Graphs and d-Dimensional Bin Packing 162
A Structural Lemma in 2-Dimensional Packing, and its Implications on Approximability 161
Recovery-Robust Platforming by Network Buffering 159
A Heuristic Algorithm for the Train-Unit Assignment Problem 159
Solution of the Train Platforming Problem 155
Global Optimization Problems and Domain Reduction Strategies 153
Delay-Robust Event Scheduling 153
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 152
A branch-and-cut algorithm for multiple sequence alignment 151
Optimization Problems in Passenger Railway Systems 147
Practical solution of periodic filtered approximation as a convex quadratic integer program 147
11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems 142
Decorous Lower Bounds for Minimum Linear Arrangement 141
Lower Bounds for the Minimum Linear Arrangement of a Graph 138
Robust Train Routing and Online Re-scheduling 136
Solution of the Train Platforming Problem 135
Optima 132
Recoverable Robustness for Scheduling with Precedence Constraints 130
Optima 123
Optimal Linear Arrangements Using Betweenness Variables 122
Laying Out Sparse Graphs with Provably Minimum Bandwidth 122
New Techniques for Cost Sharing in Combinatorial Optimization Games 121
Modified Subset Sum Algorithms for Bin Packing 119
Computational Combinatorial Optimization: A Book Review 117
Packing d-Dimensional Bins in d Stages 116
Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation 116
OPTIMA 114
Optima 113
OPTIMA 112
Improved Approximation Algorithms for Multidimensional Bin Packing Problems 112
Optima 108
Embedding Cuts in a Branch-and-Cut Framework: a Computational Study with {0, 1/2}-Cuts 107
Optima 82
Modeling and solving the crew rostering problem 64
Bilevel Knapsack with interdiction constraints 57
An approximation scheme for the two-stage, two-dimensional bin packing problem 55
Totale 13.610
Salva come PNG Salva come JPEG
Categoria #
all - tutte 34.481
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 34.481
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20222.252 0 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/20263.108 104 204 349 240 357 226 323 132 579 280 156 158
2026/2027116 70 46 0 0 0 0 0 0 0 0 0 0
Totale 13.610