CAPRARA, ALBERTO
 Distribuzione geografica
Continente #
NA - Nord America 6.703
AS - Asia 3.734
EU - Europa 3.239
AF - Africa 226
SA - Sud America 196
Continente sconosciuto - Info sul continente non disponibili 111
OC - Oceania 9
Totale 14.218
Nazione #
US - Stati Uniti d'America 6.617
SG - Singapore 1.021
VN - Vietnam 1.010
GB - Regno Unito 866
CN - Cina 841
DE - Germania 442
IT - Italia 420
UA - Ucraina 315
SE - Svezia 276
HK - Hong Kong 256
FR - Francia 237
RU - Federazione Russa 189
IN - India 184
NL - Olanda 142
BR - Brasile 125
IE - Irlanda 96
JP - Giappone 93
JO - Giordania 77
ZA - Sudafrica 72
BD - Bangladesh 63
EE - Estonia 61
TG - Togo 58
CA - Canada 47
CI - Costa d'Avorio 43
KR - Corea 34
FI - Finlandia 30
BG - Bulgaria 28
PH - Filippine 28
CH - Svizzera 27
SC - Seychelles 26
AR - Argentina 25
ID - Indonesia 20
TH - Thailandia 20
TR - Turchia 20
PL - Polonia 19
GR - Grecia 17
BE - Belgio 16
MX - Messico 15
AT - Austria 13
EC - Ecuador 12
PK - Pakistan 12
ES - Italia 10
IQ - Iraq 10
AU - Australia 9
CL - Cile 9
VE - Venezuela 9
CO - Colombia 8
HR - Croazia 7
MA - Marocco 7
MY - Malesia 7
TW - Taiwan 7
KE - Kenya 6
CR - Costa Rica 5
NG - Nigeria 5
NP - Nepal 5
SI - Slovenia 5
GT - Guatemala 4
LT - Lituania 4
NI - Nicaragua 4
PY - Paraguay 4
RO - Romania 4
SA - Arabia Saudita 4
UZ - Uzbekistan 4
HU - Ungheria 3
IL - Israele 3
JM - Giamaica 3
OM - Oman 3
PE - Perù 3
TN - Tunisia 3
AZ - Azerbaigian 2
CZ - Repubblica Ceca 2
HN - Honduras 2
IR - Iran 2
LB - Libano 2
LV - Lettonia 2
PT - Portogallo 2
RS - Serbia 2
TT - Trinidad e Tobago 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
IS - Islanda 1
KG - Kirghizistan 1
KW - Kuwait 1
KY - Cayman, isole 1
LY - Libia 1
MD - Moldavia 1
PA - Panama 1
QA - Qatar 1
SK - Slovacchia (Repubblica Slovacca) 1
SR - Suriname 1
SY - Repubblica araba siriana 1
Totale 14.108
Città #
Ann Arbor 1.231
Southend 748
Singapore 634
Fairfield 550
San Jose 390
Ashburn 387
Santa Clara 329
Chandler 294
Dong Ket 285
Wilmington 256
Hong Kong 237
Woodbridge 232
Seattle 229
Jacksonville 226
Houston 209
Cambridge 201
Council Bluffs 187
Princeton 174
Ho Chi Minh City 146
Hanoi 125
Boardman 103
Beijing 97
Dublin 96
Nanjing 89
Turin 87
Hefei 79
Tokyo 79
Amman 77
Los Angeles 77
Lauterbourg 76
Westminster 75
Padova 74
Lomé 58
Milan 51
Dallas 48
Frankfurt am Main 48
New York 45
Abidjan 43
Saint Petersburg 42
Berlin 41
Buffalo 41
Jinan 40
Chicago 39
Mülheim 39
The Dalles 39
Medford 33
Shenyang 33
Nanchang 28
Sofia 28
Changsha 27
Helsinki 27
Bologna 25
Mahé 25
Hebei 24
Seoul 24
San Francisco 23
Da Nang 20
Des Moines 20
Guangzhou 20
Norwalk 19
Rome 19
Haiphong 18
Hangzhou 17
Tianjin 16
Phoenix 15
San Diego 15
Bern 14
Shanghai 14
Straelen 14
São Paulo 14
Taizhou 14
Bengaluru 13
Brussels 13
Denver 13
Redondo Beach 13
Redwood City 13
San Venanzo 13
Toronto 13
Lanzhou 12
Munich 12
Verona 12
Warsaw 12
Olalla 11
Orem 11
Zhengzhou 11
Brooklyn 10
Dearborn 10
Falkenstein 10
Haikou 10
Johannesburg 10
Chengdu 9
Montreal 9
Nuremberg 9
Plain City 9
Taiyuan 9
West Lafayette 9
Bangkok 8
Ithaca 8
Jakarta 8
Moscow 8
Totale 9.507
Nome #
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 301
A Column Generation Approach to Train Timetabling in a Corridor 299
A Lagrangian Heuristic for a Train-Unit Assignment Problem 272
A new lower bound for curriculum-based course timetabling 272
Railway Rolling Stock Planning: Robustness Against Large Disruptions 269
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation 266
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs 261
A Freight Service Design Problem for a Railway Corridor 257
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling 252
Non-cyclic Train Timetabling and Comparability Graphs 251
Models and Algorithms for the Train Unit Assignment Problem 250
An Effective Peak Period Heuristic for Railway Rolling Stock Planning 246
Comparison of static vehicle flow assignment methods and micro-simulations for a Personal Rapid Transit network 243
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing 237
Scheduling Extra Freight Trains on Railway Networks 237
A Fast Heuristic Algorithm for the Train Unit Assignment Problem 231
Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications 228
On integer polytopes with few nonzero vertices 228
An Efficient Profile-Based Algorithm for Scratchpad Memory Partitioning 226
Bidimensional packing by bilinear programming 221
A Service Design Problem for a Railway Network 218
An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms 218
An Approximation Scheme for Two-Stage, Two- Dimensional Knapsack 216
Solving a Real-World Train-Unit Assignment Problem 216
Packing into the smallest square: Worst-case analysis of lower bounds 214
An Application of Network Design with Orientation Constraints 210
Worst-Case Analysis of the Subset Sum Algorithm for Bin Packing 207
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap 206
Packing Cuts in Undirected Graphs 206
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing 205
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 203
Recoverable Robustness for Railway Rolling Stock Planning 200
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics 200
Bilevel Knapsack with interdiction constraints 195
Knapsack Problems: A Book Review 194
A Study on the Computational Complexity of the Bilevel Knapsack Problem 194
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation 187
Non-cyclic Train Timetabling and Comparability Graphs 186
A Complexity and Approximability Study of the Bilevel Knapsack Problem 181
Solving a Real-World Train Unit Assignment Problem 181
Constrained 0-1 Quadratic Programming: Basic Approaches and Extensions 171
A New Lower Bound for the Minimum Linear Arrangement of a Graph 169
On d-Threshold Graphs and d-Dimensional Bin Packing 169
A Structural Lemma in 2-Dimensional Packing, and its Implications on Approximability 167
Recovery-Robust Platforming by Network Buffering 166
A Heuristic Algorithm for the Train-Unit Assignment Problem 164
Solution of the Train Platforming Problem 162
Global Optimization Problems and Domain Reduction Strategies 162
A branch-and-cut algorithm for multiple sequence alignment 162
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 161
Delay-Robust Event Scheduling 160
Practical solution of periodic filtered approximation as a convex quadratic integer program 154
Optimization Problems in Passenger Railway Systems 152
11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems 149
Lower Bounds for the Minimum Linear Arrangement of a Graph 146
Decorous Lower Bounds for Minimum Linear Arrangement 144
Robust Train Routing and Online Re-scheduling 142
Solution of the Train Platforming Problem 141
Recoverable Robustness for Scheduling with Precedence Constraints 139
Optima 137
Laying Out Sparse Graphs with Provably Minimum Bandwidth 135
Packing d-Dimensional Bins in d Stages 132
Optima 131
Modified Subset Sum Algorithms for Bin Packing 131
Optimal Linear Arrangements Using Betweenness Variables 130
New Techniques for Cost Sharing in Combinatorial Optimization Games 127
Computational Combinatorial Optimization: A Book Review 124
Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation 123
Improved Approximation Algorithms for Multidimensional Bin Packing Problems 123
Optima 119
OPTIMA 119
Optima 117
OPTIMA 116
Embedding Cuts in a Branch-and-Cut Framework: a Computational Study with {0, 1/2}-Cuts 111
Optima 88
Modeling and solving the crew rostering problem 68
Bilevel Knapsack with interdiction constraints 63
An approximation scheme for the two-stage, two-dimensional bin packing problem 60
Totale 14.218
Categoria #
all - tutte 36.258
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 36.258


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20221.965 0 0 0 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/2027724 70 134 291 229 0 0 0 0 0 0 0 0
Totale 14.218