IRIS Institutional Research Information System - OPENBS Open Archive UniBS

ANGELELLI, Enrico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.633
EU - Europa 4.213
AS - Asia 2.736
SA - Sud America 512
Continente sconosciuto - Info sul continente non disponibili 225
AF - Africa 82
OC - Oceania 11
Totale 13.412
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.556
DE - Germania 1.349
RU - Federazione Russa 1.312
CN - Cina 1.007
SG - Singapore 904
UA - Ucraina 531
BR - Brasile 425
IT - Italia 407
HK - Hong Kong 313
VN - Vietnam 161
FR - Francia 127
FI - Finlandia 121
GB - Regno Unito 113
TR - Turchia 98
IE - Irlanda 87
IN - India 74
AR - Argentina 38
BD - Bangladesh 37
CA - Canada 36
SE - Svezia 34
IQ - Iraq 21
ES - Italia 20
BE - Belgio 19
JP - Giappone 16
AT - Austria 15
GH - Ghana 15
MX - Messico 15
PL - Polonia 15
ZA - Sudafrica 15
NG - Nigeria 14
DZ - Algeria 13
ID - Indonesia 12
PK - Pakistan 12
AU - Australia 11
CZ - Repubblica Ceca 11
EC - Ecuador 11
UZ - Uzbekistan 11
SA - Arabia Saudita 10
CO - Colombia 9
LT - Lituania 9
NL - Olanda 9
CL - Cile 8
DK - Danimarca 8
VE - Venezuela 8
EU - Europa 7
IR - Iran 7
KE - Kenya 7
AZ - Azerbaigian 6
IL - Israele 6
PH - Filippine 6
RO - Romania 6
BB - Barbados 5
NO - Norvegia 5
PY - Paraguay 5
TT - Trinidad e Tobago 5
JO - Giordania 4
KZ - Kazakistan 4
PE - Perù 4
TW - Taiwan 4
BG - Bulgaria 3
EG - Egitto 3
HN - Honduras 3
JM - Giamaica 3
LK - Sri Lanka 3
MA - Marocco 3
MU - Mauritius 3
MY - Malesia 3
SV - El Salvador 3
TN - Tunisia 3
UY - Uruguay 3
AE - Emirati Arabi Uniti 2
BH - Bahrain 2
BY - Bielorussia 2
DO - Repubblica Dominicana 2
GE - Georgia 2
HU - Ungheria 2
LB - Libano 2
OM - Oman 2
PT - Portogallo 2
SK - Slovacchia (Repubblica Slovacca) 2
TH - Thailandia 2
AM - Armenia 1
BS - Bahamas 1
CG - Congo 1
CH - Svizzera 1
CI - Costa d'Avorio 1
CR - Costa Rica 1
CU - Cuba 1
CV - Capo Verde 1
ET - Etiopia 1
GR - Grecia 1
GT - Guatemala 1
GY - Guiana 1
KH - Cambogia 1
KW - Kuwait 1
LA - Repubblica Popolare Democratica del Laos 1
LY - Libia 1
ME - Montenegro 1
NE - Niger 1
PA - Panama 1
Totale 13.192
Salva come PNG Salva come JPEG
Città #
Ufa 991
Fairfield 656
Woodbridge 541
Singapore 478
Houston 422
Jacksonville 382
Ashburn 367
Ann Arbor 313
Hong Kong 311
Seattle 249
Wilmington 237
Cambridge 231
Chandler 197
San Jose 179
The Dalles 177
Beijing 164
Princeton 161
Brescia 159
Nanjing 154
Dublin 87
Los Angeles 83
Columbus 80
Nürnberg 76
Istanbul 75
Lauterbourg 72
Council Bluffs 69
Ho Chi Minh City 65
New York 54
Dearborn 51
Helsinki 49
Nanchang 49
Moscow 46
São Paulo 45
Hanoi 41
Hebei 39
Des Moines 38
Changsha 37
Shenyang 37
Dallas 36
Buffalo 34
Jinan 32
Tianjin 30
Jiaxing 29
Chicago 28
Milan 28
San Francisco 28
San Diego 26
Shanghai 25
Redondo Beach 22
Santa Clara 22
Orem 21
Brussels 19
Phoenix 19
Chennai 18
Rio de Janeiro 18
Hangzhou 17
Accra 15
London 15
Montreal 15
Ningbo 14
Stockholm 14
Zhengzhou 14
Brooklyn 13
Naples 13
Abuja 12
Lancaster 12
Manchester 12
Monza 12
Tokyo 12
Denver 11
Haikou 11
Kunming 11
Norwalk 11
Porto Alegre 11
Taizhou 11
Baghdad 10
Belo Horizonte 10
Boston 10
Guangzhou 10
Lanzhou 10
Boardman 9
Johannesburg 9
Mumbai 9
Taiyuan 9
Bergamo 8
Tashkent 8
Vienna 8
Atlanta 7
Casamassima 7
Curitiba 7
Desenzano del Garda 7
Frankfurt am Main 7
Haiphong 7
Hải Dương 7
Kocaeli 7
Kongens Lyngby 7
Munich 7
Padova 7
Quito 7
Rome 7
Totale 8.354
Salva come PNG Salva come JPEG
Nome #
A Dynamic Multi-Period Routing Problem 1.115
Kernel Search: A heuristic framework for MILP problems with binary variables 244
The stochastic and dynamic traveling purchaser problem 222
Optimal interval scheduling with a resource constraint 204
Proactive route guidance to avoid congestion 200
The Stochastic and Dynamic Traveling Purchaser Problem 199
Congestion avoiding heuristic path generation for the proactive route guidance 199
The Traveling Purchaser Problem with time-dependent quantities 197
The probabilistic orienteering problem 197
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints 195
The Clustered Orienteering Problem 187
Comparison of policies in dynamic routing problems 184
Geometric representation for semi on-line scheduling on uniform processors 183
A real-time vehicle routing model for a courier service problem 183
Management policies in a dynamic multi-period routing problem 179
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 177
Maximum Expected Utility of Markovian Predicted Wealth 176
Kernel Search: A new heuristic framework for portfolio selection 176
Timing portfolio strategies with exponential Lévy processes 176
Short Term Strategies for a Dynamic Multi-Period Routing Problem 173
Look-ahead heuristics for the dynamic traveling purchaser problem 173
The Clustered Orienteering Problem 172
A reclaimer scheduling problem arising in coal stockyard management 172
A comparison of Mad and CVaR with side constraints 169
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 167
Short Term Strategies for a Dynamic Multi-Period Routing Problem 165
Comparison of policies in dynamic routing problems 162
Short Term Strategies for a Dynamic Multi-period Routing Problem 158
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 157
The application of a vehicle routing model to a waste collection problem: two case studies 155
Exploring greedy criteria for the dynamic traveling purchaser problem 155
American and European Portfolio Selection Strategies: The Markovian Approach 153
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 153
Improved bounds for a semi on-line scheduling problem on two parallel processors 151
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 149
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 148
A comparison of MAD and CVaR with side constraints 147
Complexity and approximation for Traveling Salesman Problems with profits 147
Financial Applications of Bivariate Markov Processes 147
Complexity and approximation for Traveling Salesman Problems with profits 147
Semi on-line scheduling on three processors with known sum of the tasks 146
On the complexity of interval scheduling with a resource constraint 145
The application of a vehicle routing model to a waste-collection problem: two case studies 144
On the complexity of interval scheduling with a resource constraint 144
Semi on-line scheduling on two parallel processors with upper bound on the items 143
The periodic vehicle routing problem with intermediate facilities 142
A dynamic multi-period routing problem 142
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 141
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 141
A Dynamic Multi-Period Routing Problem 141
Set-Portfolio Selection with the Use of Market Stochastic Bounds 140
Volume-Return portfolio selection and large scale dimensional problems with bivariate Markov chains 136
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 134
The Dynamic Travelling Purchaser Problem 131
The Orienteering Problem with Set Constraints 131
A dynamic and probabilistic orienteering problem 131
American and European Portfolio Selection Strategies: The Markovian Approach 130
Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks 129
The dynamic traveling purchaser problem 129
An asymptotic Markovian approach to the portfolio selection problem 127
The on-line multiprocessor scheduling problem with known sum of the tasks 126
The conditional value at risk with side constraints 123
International portfolio selection with Markov processes and liquidity constraints 119
The Dynamic Traveling Purchaser Problem 117
Some possible applications of bivariate Markov processes 114
Core Search: An application to portfolio optimisation 112
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 109
Set-Portfolio Selection with the Use of Stochastic Bounds 109
Semi on-line scheduling on two uniform processors 107
Semi on-line scheduling on two uniform processors 105
The Markovian portfolio selection model with GARCH volatility dynamics 104
Dimensional portfolio reduction problems with asymptotic Markov processes 104
Portfolio Choice: A Non Parametric Markovian Framework 100
Semi on-line scheduling on two uniform processors 98
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 98
GARCH type portfolio selection models with the Markovian approach 98
Minimizing the total travel time with limited unfairness in traffic networks 96
On the application of Markov processes to the large scale portfolio selection problem 94
A simulation framework for a station-based bike-sharing system 94
System optimal routing of traffic flows with user constraints using linear programming 93
A Matheuristic for the Air Transportation Freight Forwarder Service Problem 91
Semi on-line scheduling on two parallel processors with lower and upper bound on the tasks 90
Multi-day fair collaboration in demand-responsive transportation 87
Optimization models for fair horizontal collaboration in demand-responsive transportation 66
Solving the probabilistic profitable tour problem on a line 62
A real-time vehicle routing model for a courier service problem 61
The one-station bike repositioning problem 59
Kernel Search: A new heuristic framework for portfolio selection 51
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree 49
The impact of machine learning forecasting on strategic decision-making for bike sharing systems 16
Totale 13.412
Salva come PNG Salva come JPEG
Categoria #
all - tutte 53.465
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 53.465
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022581 0 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/20262.770 283 356 265 488 279 136 322 116 196 204 86 39
2026/2027238 148 90 0 0 0 0 0 0 0 0 0 0
Totale 13.412