CAPRARA, ALBERTO
 Distribuzione geografica
Continente #
NA - Nord America 5.517
EU - Europa 3.031
AS - Asia 2.911
AF - Africa 207
SA - Sud America 138
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 1
Totale 11.813
Nazione #
US - Stati Uniti d'America 5.477
SG - Singapore 939
GB - Regno Unito 855
CN - Cina 765
VN - Vietnam 577
DE - Germania 427
IT - Italia 344
UA - Ucraina 312
SE - Svezia 276
HK - Hong Kong 241
RU - Federazione Russa 184
IN - India 160
FR - Francia 158
NL - Olanda 138
IE - Irlanda 96
BR - Brasile 95
JP - Giappone 77
JO - Giordania 76
ZA - Sudafrica 68
EE - Estonia 61
TG - Togo 58
CI - Costa d'Avorio 43
FI - Finlandia 29
BG - Bulgaria 28
CA - Canada 26
KR - Corea 26
SC - Seychelles 26
AR - Argentina 21
CH - Svizzera 21
PL - Polonia 18
GR - Grecia 17
BE - Belgio 16
AT - Austria 12
TR - Turchia 11
ID - Indonesia 10
MX - Messico 9
AU - Australia 8
ES - Italia 7
HR - Croazia 6
BD - Bangladesh 5
CL - Cile 5
EC - Ecuador 5
NG - Nigeria 5
SI - Slovenia 5
LT - Lituania 4
MA - Marocco 4
RO - Romania 4
HU - Ungheria 3
PE - Perù 3
PY - Paraguay 3
TH - Thailandia 3
VE - Venezuela 3
CO - Colombia 2
CR - Costa Rica 2
CZ - Repubblica Ceca 2
IL - Israele 2
IQ - Iraq 2
IR - Iran 2
KE - Kenya 2
LB - Libano 2
LV - Lettonia 2
PK - Pakistan 2
PT - Portogallo 2
UZ - Uzbekistan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AM - Armenia 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BF - Burkina Faso 1
BH - Bahrain 1
GT - Guatemala 1
IS - Islanda 1
KW - Kuwait 1
NI - Nicaragua 1
NP - Nepal 1
OM - Oman 1
PH - Filippine 1
RS - Serbia 1
SA - Arabia Saudita 1
SK - Slovacchia (Repubblica Slovacca) 1
SR - Suriname 1
TT - Trinidad e Tobago 1
TW - Taiwan 1
Totale 11.813
Città #
Ann Arbor 1.230
Southend 748
Singapore 560
Fairfield 550
Ashburn 319
Santa Clara 316
Chandler 294
Dong Ket 285
Wilmington 255
Woodbridge 232
Hong Kong 226
Jacksonville 225
Seattle 225
Houston 206
Cambridge 201
Princeton 165
Dublin 96
Boardman 95
Beijing 91
Nanjing 89
Turin 83
Hefei 78
Amman 76
Westminster 75
Padova 74
Tokyo 68
Lomé 58
Los Angeles 58
Ho Chi Minh City 47
Abidjan 43
Frankfurt am Main 43
Saint Petersburg 42
Berlin 41
Dallas 40
Jinan 40
Mülheim 39
Buffalo 38
Shenyang 33
Medford 32
Milan 32
Hanoi 28
Nanchang 28
Sofia 28
Changsha 26
Helsinki 26
Mahé 25
The Dalles 25
Hebei 24
Seoul 23
Bologna 21
Des Moines 20
New York 19
Norwalk 19
Guangzhou 18
San Francisco 17
Chicago 16
San Diego 15
Tianjin 15
Bern 14
Hangzhou 14
Straelen 14
Taizhou 14
Brussels 13
Redondo Beach 13
Redwood City 13
San Venanzo 13
Lanzhou 12
Shanghai 12
São Paulo 12
Verona 12
Olalla 11
Toronto 11
Warsaw 11
Zhengzhou 11
Falkenstein 10
Haikou 10
Munich 10
Bengaluru 9
Dearborn 9
Orem 9
San Jose 9
Taiyuan 9
West Lafayette 9
Ithaca 8
Montreal 8
Chengdu 7
Denver 7
Fremont 7
Jiaxing 7
Johannesburg 7
Moscow 7
Nuremberg 7
Paris 7
Phoenix 7
Belo Horizonte 6
Bend 6
Bühl 6
Central 6
Chennai 6
Jakarta 6
Totale 8.240
Nome #
A Lagrangian Heuristic Algorithm for a Real-World Train Timetabling Problem 267
A Column Generation Approach to Train Timetabling in a Corridor 262
A new lower bound for curriculum-based course timetabling 241
A Lagrangian Heuristic for a Train-Unit Assignment Problem 239
A Freight Service Design Problem for a Railway Corridor 225
Railway Rolling Stock Planning: Robustness Against Large Disruptions 224
Non-cyclic Train Timetabling and Comparability Graphs 219
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs 218
Models and Algorithms for the Train Unit Assignment Problem 213
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing 210
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling 207
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation 207
An Efficient Profile-Based Algorithm for Scratchpad Memory Partitioning 203
An Effective Peak Period Heuristic for Railway Rolling Stock Planning 203
A Fast Heuristic Algorithm for the Train Unit Assignment Problem 201
An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms 199
Scheduling Extra Freight Trains on Railway Networks 196
On integer polytopes with few nonzero vertices 195
Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications 192
Comparison of static vehicle flow assignment methods and micro-simulations for a Personal Rapid Transit network 190
Packing into the smallest square: Worst-case analysis of lower bounds 188
An Approximation Scheme for Two-Stage, Two- Dimensional Knapsack 187
Worst-Case Analysis of the Subset Sum Algorithm for Bin Packing 185
A Service Design Problem for a Railway Network 183
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 182
Solving a Real-World Train-Unit Assignment Problem 181
Bidimensional packing by bilinear programming 180
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics 176
A Study on the Computational Complexity of the Bilevel Knapsack Problem 175
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap 172
Knapsack Problems: A Book Review 171
Recoverable Robustness for Railway Rolling Stock Planning 171
An Application of Network Design with Orientation Constraints 167
Bilevel Knapsack with interdiction constraints 162
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing 160
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation 160
Non-cyclic Train Timetabling and Comparability Graphs 159
Constrained 0-1 Quadratic Programming: Basic Approaches and Extensions 155
A Complexity and Approximability Study of the Bilevel Knapsack Problem 151
Solving a Real-World Train Unit Assignment Problem 148
A Structural Lemma in 2-Dimensional Packing, and its Implications on Approximability 145
A Heuristic Algorithm for the Train-Unit Assignment Problem 144
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 140
A New Lower Bound for the Minimum Linear Arrangement of a Graph 139
A branch-and-cut algorithm for multiple sequence alignment 139
Recovery-Robust Platforming by Network Buffering 137
Optimization Problems in Passenger Railway Systems 136
Global Optimization Problems and Domain Reduction Strategies 134
Practical solution of periodic filtered approximation as a convex quadratic integer program 132
Solution of the Train Platforming Problem 130
Delay-Robust Event Scheduling 129
Packing Cuts in Undirected Graphs 128
On d-Threshold Graphs and d-Dimensional Bin Packing 128
Lower Bounds for the Minimum Linear Arrangement of a Graph 127
11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems 122
Decorous Lower Bounds for Minimum Linear Arrangement 121
Solution of the Train Platforming Problem 118
Robust Train Routing and Online Re-scheduling 115
Optima 110
Recoverable Robustness for Scheduling with Precedence Constraints 110
Optima 109
Optimal Linear Arrangements Using Betweenness Variables 108
Laying Out Sparse Graphs with Provably Minimum Bandwidth 107
Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation 106
New Techniques for Cost Sharing in Combinatorial Optimization Games 106
Packing d-Dimensional Bins in d Stages 105
Modified Subset Sum Algorithms for Bin Packing 103
Computational Combinatorial Optimization: A Book Review 100
OPTIMA 99
Optima 98
Optima 97
OPTIMA 95
Improved Approximation Algorithms for Multidimensional Bin Packing Problems 95
Embedding Cuts in a Branch-and-Cut Framework: a Computational Study with {0, 1/2}-Cuts 94
Optima 71
An approximation scheme for the two-stage, two-dimensional bin packing problem 39
Bilevel Knapsack with interdiction constraints 37
Modeling and solving the crew rostering problem 34
Totale 11.911
Categoria #
all - tutte 29.783
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 29.783


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021700 0 0 0 0 0 0 24 85 97 72 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/20261.525 104 204 349 240 357 226 45 0 0 0 0 0
Totale 11.911