ANGELELLI, Enrico
 Distribuzione geografica
Continente #
NA - Nord America 4.955
EU - Europa 4.044
AS - Asia 2.342
SA - Sud America 480
AF - Africa 60
OC - Oceania 11
Continente sconosciuto - Info sul continente non disponibili 7
Totale 11.899
Nazione #
US - Stati Uniti d'America 4.903
DE - Germania 1.338
RU - Federazione Russa 1.311
CN - Cina 875
SG - Singapore 760
UA - Ucraina 529
BR - Brasile 406
IT - Italia 359
HK - Hong Kong 300
VN - Vietnam 126
FI - Finlandia 116
GB - Regno Unito 106
TR - Turchia 90
IE - Irlanda 87
IN - India 57
FR - Francia 45
AR - Argentina 37
SE - Svezia 34
CA - Canada 28
BD - Bangladesh 24
ES - Italia 20
BE - Belgio 19
GH - Ghana 15
AT - Austria 14
MX - Messico 13
PL - Polonia 13
DZ - Algeria 12
IQ - Iraq 12
JP - Giappone 12
AU - Australia 11
CZ - Repubblica Ceca 11
ID - Indonesia 11
UZ - Uzbekistan 11
ZA - Sudafrica 11
EC - Ecuador 9
PK - Pakistan 9
DK - Danimarca 8
LT - Lituania 8
EU - Europa 7
IR - Iran 7
CL - Cile 6
IL - Israele 6
KE - Kenya 6
SA - Arabia Saudita 6
AZ - Azerbaigian 5
CO - Colombia 5
NL - Olanda 5
VE - Venezuela 5
KZ - Kazakistan 4
NO - Norvegia 4
PE - Perù 4
PY - Paraguay 4
TW - Taiwan 4
BB - Barbados 3
EG - Egitto 3
JO - Giordania 3
MU - Mauritius 3
RO - Romania 3
UY - Uruguay 3
AE - Emirati Arabi Uniti 2
BG - Bulgaria 2
BY - Bielorussia 2
DO - Repubblica Dominicana 2
GE - Georgia 2
HU - Ungheria 2
LK - Sri Lanka 2
MA - Marocco 2
MY - Malesia 2
NG - Nigeria 2
OM - Oman 2
PH - Filippine 2
PT - Portogallo 2
SK - Slovacchia (Repubblica Slovacca) 2
TH - Thailandia 2
TN - Tunisia 2
TT - Trinidad e Tobago 2
AM - Armenia 1
BH - Bahrain 1
CG - Congo 1
CH - Svizzera 1
CI - Costa d'Avorio 1
CV - Capo Verde 1
GR - Grecia 1
GT - Guatemala 1
GY - Guiana 1
HN - Honduras 1
KW - Kuwait 1
LA - Repubblica Popolare Democratica del Laos 1
LB - Libano 1
ME - Montenegro 1
NE - Niger 1
PA - Panama 1
PS - Palestinian Territory 1
RS - Serbia 1
SV - El Salvador 1
Totale 11.899
Città #
Ufa 991
Fairfield 656
Woodbridge 541
Houston 419
Jacksonville 382
Singapore 355
Ann Arbor 313
Hong Kong 298
Ashburn 297
Seattle 246
Wilmington 237
Cambridge 231
Chandler 197
Princeton 161
Beijing 160
Nanjing 154
Brescia 146
The Dalles 98
Dublin 87
Los Angeles 77
Nürnberg 76
Istanbul 74
Dearborn 51
New York 51
Ho Chi Minh City 49
Nanchang 49
Moscow 46
Helsinki 44
São Paulo 44
Hebei 39
Des Moines 38
Changsha 37
Shenyang 37
Buffalo 34
Hanoi 34
Dallas 32
Jinan 32
Jiaxing 29
Tianjin 29
San Francisco 27
Milan 26
San Diego 26
Chicago 25
Shanghai 23
Redondo Beach 22
Brussels 19
Rio de Janeiro 18
Hangzhou 16
Accra 15
Chennai 14
London 14
Montreal 14
Ningbo 14
Stockholm 14
Zhengzhou 14
Brooklyn 13
Phoenix 13
Haikou 11
Kunming 11
Lancaster 11
Monza 11
Norwalk 11
Taizhou 11
Belo Horizonte 10
Boston 10
Denver 10
Lanzhou 10
Porto Alegre 10
Boardman 9
Guangzhou 9
Taiyuan 9
Tokyo 9
Bergamo 8
Tashkent 8
Casamassima 7
Haiphong 7
Hải Dương 7
Johannesburg 7
Kocaeli 7
Kongens Lyngby 7
Manchester 7
Munich 7
Padova 7
Verona 7
Vienna 7
Algiers 6
Changchun 6
Curitiba 6
Desio 6
Nairobi 6
Orem 6
Philadelphia 6
Poplar 6
Quito 6
Rome 6
Wroclaw 6
Ankara 5
Artogne 5
Baku 5
Brasília 5
Totale 7.529
Nome #
A Dynamic Multi-Period Routing Problem 1.104
Kernel Search: A heuristic framework for MILP problems with binary variables 213
The stochastic and dynamic traveling purchaser problem 211
The probabilistic orienteering problem 189
The Traveling Purchaser Problem with time-dependent quantities 188
Optimal interval scheduling with a resource constraint 184
Congestion avoiding heuristic path generation for the proactive route guidance 184
Proactive route guidance to avoid congestion 179
The Clustered Orienteering Problem 178
Geometric representation for semi on-line scheduling on uniform processors 174
Comparison of policies in dynamic routing problems 171
The Stochastic and Dynamic Traveling Purchaser Problem 169
Maximum Expected Utility of Markovian Predicted Wealth 168
A real-time vehicle routing model for a courier service problem 168
Timing portfolio strategies with exponential Lévy processes 168
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints 168
Kernel Search: A new heuristic framework for portfolio selection 164
Management policies in a dynamic multi-period routing problem 163
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 161
A reclaimer scheduling problem arising in coal stockyard management 160
Short Term Strategies for a Dynamic Multi-Period Routing Problem 158
The Clustered Orienteering Problem 158
Look-ahead heuristics for the dynamic traveling purchaser problem 156
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 150
Comparison of policies in dynamic routing problems 147
The application of a vehicle routing model to a waste collection problem: two case studies 145
Exploring greedy criteria for the dynamic traveling purchaser problem 145
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 145
Short Term Strategies for a Dynamic Multi-period Routing Problem 145
Short Term Strategies for a Dynamic Multi-Period Routing Problem 144
A comparison of Mad and CVaR with side constraints 144
Financial Applications of Bivariate Markov Processes 141
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 139
Complexity and approximation for Traveling Salesman Problems with profits 139
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 138
Semi on-line scheduling on two parallel processors with upper bound on the items 138
Improved bounds for a semi on-line scheduling problem on two parallel processors 138
On the complexity of interval scheduling with a resource constraint 138
Semi on-line scheduling on three processors with known sum of the tasks 135
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 135
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 135
On the complexity of interval scheduling with a resource constraint 135
The application of a vehicle routing model to a waste-collection problem: two case studies 134
Complexity and approximation for Traveling Salesman Problems with profits 134
Set-Portfolio Selection with the Use of Market Stochastic Bounds 133
The periodic vehicle routing problem with intermediate facilities 131
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 131
American and European Portfolio Selection Strategies: The Markovian Approach 129
A dynamic multi-period routing problem 126
A Dynamic Multi-Period Routing Problem 125
A comparison of MAD and CVaR with side constraints 122
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 121
The on-line multiprocessor scheduling problem with known sum of the tasks 119
Volume-Return portfolio selection and large scale dimensional problems with bivariate Markov chains 118
American and European Portfolio Selection Strategies: The Markovian Approach 117
The Orienteering Problem with Set Constraints 117
Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks 116
The Dynamic Travelling Purchaser Problem 114
A dynamic and probabilistic orienteering problem 112
An asymptotic Markovian approach to the portfolio selection problem 111
The dynamic traveling purchaser problem 108
The conditional value at risk with side constraints 106
Some possible applications of bivariate Markov processes 105
Core Search: An application to portfolio optimisation 104
International portfolio selection with Markov processes and liquidity constraints 102
The Dynamic Traveling Purchaser Problem 100
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 99
Set-Portfolio Selection with the Use of Stochastic Bounds 98
Dimensional portfolio reduction problems with asymptotic Markov processes 96
Semi on-line scheduling on two uniform processors 95
The Markovian portfolio selection model with GARCH volatility dynamics 93
Semi on-line scheduling on two uniform processors 92
GARCH type portfolio selection models with the Markovian approach 90
Portfolio Choice: A Non Parametric Markovian Framework 87
Semi on-line scheduling on two uniform processors 86
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 84
On the application of Markov processes to the large scale portfolio selection problem 83
Semi on-line scheduling on two parallel processors with lower and upper bound on the tasks 82
Minimizing the total travel time with limited unfairness in traffic networks 76
System optimal routing of traffic flows with user constraints using linear programming 75
A simulation framework for a station-based bike-sharing system 75
A Matheuristic for the Air Transportation Freight Forwarder Service Problem 67
Multi-day fair collaboration in demand-responsive transportation 62
Optimization models for fair horizontal collaboration in demand-responsive transportation 53
A real-time vehicle routing model for a courier service problem 44
The one-station bike repositioning problem 42
Kernel Search: A new heuristic framework for portfolio selection 41
Solving the probabilistic profitable tour problem on a line 39
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree 8
Totale 12.114
Categoria #
all - tutte 46.722
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 46.722


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021734 0 0 0 0 0 123 29 132 203 97 122 28
2021/2022616 35 127 34 14 10 32 34 48 36 70 45 131
2022/2023619 85 12 13 59 55 158 13 79 92 3 26 24
2023/20241.501 34 13 31 34 18 45 34 447 643 106 10 86
2024/20251.342 13 19 13 145 168 121 114 32 127 148 304 138
2025/20261.710 283 356 265 488 279 39 0 0 0 0 0 0
Totale 12.114