IRIS Institutional Research Information System - OPENBS Open Archive UniBS

ANGELELLI, Enrico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.423
EU - Europa 4.195
AS - Asia 2.722
SA - Sud America 504
AF - Africa 82
OC - Oceania 11
Continente sconosciuto - Info sul continente non disponibili 7
Totale 12.944
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.358
DE - Germania 1.347
RU - Federazione Russa 1.312
CN - Cina 1.006
SG - Singapore 901
UA - Ucraina 531
BR - Brasile 421
IT - Italia 400
HK - Hong Kong 309
VN - Vietnam 160
FR - Francia 125
FI - Finlandia 120
GB - Regno Unito 113
TR - Turchia 97
IE - Irlanda 87
IN - India 74
AR - Argentina 38
BD - Bangladesh 34
CA - Canada 34
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
UZ - Uzbekistan 11
EC - Ecuador 10
SA - Arabia Saudita 9
CL - Cile 8
DK - Danimarca 8
LT - Lituania 8
NL - Olanda 8
VE - Venezuela 8
EU - Europa 7
IR - Iran 7
KE - Kenya 7
AZ - Azerbaigian 6
CO - Colombia 6
IL - Israele 6
PH - Filippine 6
NO - Norvegia 5
PY - Paraguay 5
BB - Barbados 4
JO - Giordania 4
KZ - Kazakistan 4
PE - Perù 4
TW - Taiwan 4
EG - Egitto 3
LK - Sri Lanka 3
MA - Marocco 3
MU - Mauritius 3
MY - Malesia 3
RO - Romania 3
TN - Tunisia 3
UY - Uruguay 3
AE - Emirati Arabi Uniti 2
BG - Bulgaria 2
BH - Bahrain 2
BY - Bielorussia 2
DO - Repubblica Dominicana 2
GE - Georgia 2
HN - Honduras 2
HU - Ungheria 2
LB - Libano 2
OM - Oman 2
PT - Portogallo 2
SK - Slovacchia (Repubblica Slovacca) 2
SV - El Salvador 2
TH - Thailandia 2
TT - Trinidad e Tobago 2
AM - Armenia 1
CG - Congo 1
CH - Svizzera 1
CI - Costa d'Avorio 1
CU - Cuba 1
CV - Capo Verde 1
ET - Etiopia 1
GR - Grecia 1
GT - Guatemala 1
GY - Guiana 1
JM - Giamaica 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
PS - Palestinian Territory 1
RS - Serbia 1
Totale 12.944
Salva come PNG Salva come JPEG
Città #
Ufa 991
Fairfield 656
Woodbridge 541
Singapore 475
Houston 420
Jacksonville 382
Ashburn 364
Ann Arbor 313
Hong Kong 307
Seattle 249
Wilmington 237
Cambridge 231
Chandler 197
The Dalles 177
San Jose 176
Beijing 164
Princeton 161
Brescia 157
Nanjing 154
Dublin 87
Los Angeles 82
Nürnberg 76
Istanbul 75
Lauterbourg 72
Ho Chi Minh City 64
New York 53
Dearborn 51
Nanchang 49
Helsinki 48
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
Orem 21
Brussels 19
Chennai 18
Rio de Janeiro 18
Hangzhou 17
Phoenix 17
Accra 15
London 15
Montreal 15
Ningbo 14
Stockholm 14
Zhengzhou 14
Brooklyn 13
Naples 13
Abuja 12
Manchester 12
Monza 12
Santa Clara 12
Tokyo 12
Denver 11
Haikou 11
Kunming 11
Lancaster 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
Casamassima 7
Council Bluffs 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
Rome 7
Verona 7
Warsaw 7
Algiers 6
Totale 8.184
Salva come PNG Salva come JPEG
Nome #
A Dynamic Multi-Period Routing Problem 1.113
Kernel Search: A heuristic framework for MILP problems with binary variables 239
The stochastic and dynamic traveling purchaser problem 220
Optimal interval scheduling with a resource constraint 198
Congestion avoiding heuristic path generation for the proactive route guidance 197
The Stochastic and Dynamic Traveling Purchaser Problem 196
The Traveling Purchaser Problem with time-dependent quantities 196
The probabilistic orienteering problem 195
Proactive route guidance to avoid congestion 194
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints 193
The Clustered Orienteering Problem 186
Comparison of policies in dynamic routing problems 183
Geometric representation for semi on-line scheduling on uniform processors 179
A real-time vehicle routing model for a courier service problem 179
Management policies in a dynamic multi-period routing problem 177
Maximum Expected Utility of Markovian Predicted Wealth 175
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 175
Timing portfolio strategies with exponential Lévy processes 175
Kernel Search: A new heuristic framework for portfolio selection 172
Short Term Strategies for a Dynamic Multi-Period Routing Problem 171
Look-ahead heuristics for the dynamic traveling purchaser problem 170
A reclaimer scheduling problem arising in coal stockyard management 170
The Clustered Orienteering Problem 169
A comparison of Mad and CVaR with side constraints 166
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 165
Short Term Strategies for a Dynamic Multi-Period Routing Problem 162
Comparison of policies in dynamic routing problems 160
Short Term Strategies for a Dynamic Multi-period Routing Problem 155
The application of a vehicle routing model to a waste collection problem: two case studies 154
Exploring greedy criteria for the dynamic traveling purchaser problem 154
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 153
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 152
American and European Portfolio Selection Strategies: The Markovian Approach 151
Improved bounds for a semi on-line scheduling problem on two parallel processors 149
Financial Applications of Bivariate Markov Processes 146
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 145
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 144
Complexity and approximation for Traveling Salesman Problems with profits 144
Complexity and approximation for Traveling Salesman Problems with profits 144
Semi on-line scheduling on three processors with known sum of the tasks 143
A comparison of MAD and CVaR with side constraints 142
Semi on-line scheduling on two parallel processors with upper bound on the items 142
On the complexity of interval scheduling with a resource constraint 142
The application of a vehicle routing model to a waste-collection problem: two case studies 141
On the complexity of interval scheduling with a resource constraint 141
A dynamic multi-period routing problem 140
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 139
The periodic vehicle routing problem with intermediate facilities 138
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 138
A Dynamic Multi-Period Routing Problem 138
Set-Portfolio Selection with the Use of Market Stochastic Bounds 138
Volume-Return portfolio selection and large scale dimensional problems with bivariate Markov chains 133
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 131
American and European Portfolio Selection Strategies: The Markovian Approach 128
The Orienteering Problem with Set Constraints 128
The Dynamic Travelling Purchaser Problem 127
A dynamic and probabilistic orienteering problem 127
Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks 126
The dynamic traveling purchaser problem 126
The on-line multiprocessor scheduling problem with known sum of the tasks 125
An asymptotic Markovian approach to the portfolio selection problem 124
The conditional value at risk with side constraints 120
International portfolio selection with Markov processes and liquidity constraints 116
The Dynamic Traveling Purchaser Problem 114
Some possible applications of bivariate Markov processes 112
Core Search: An application to portfolio optimisation 109
Set-Portfolio Selection with the Use of Stochastic Bounds 107
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 106
Semi on-line scheduling on two uniform processors 105
Semi on-line scheduling on two uniform processors 102
The Markovian portfolio selection model with GARCH volatility dynamics 102
Dimensional portfolio reduction problems with asymptotic Markov processes 101
Portfolio Choice: A Non Parametric Markovian Framework 97
GARCH type portfolio selection models with the Markovian approach 96
Semi on-line scheduling on two uniform processors 95
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 95
System optimal routing of traffic flows with user constraints using linear programming 92
On the application of Markov processes to the large scale portfolio selection problem 91
Minimizing the total travel time with limited unfairness in traffic networks 91
A simulation framework for a station-based bike-sharing system 91
Semi on-line scheduling on two parallel processors with lower and upper bound on the tasks 88
A Matheuristic for the Air Transportation Freight Forwarder Service Problem 87
Multi-day fair collaboration in demand-responsive transportation 83
Optimization models for fair horizontal collaboration in demand-responsive transportation 64
A real-time vehicle routing model for a courier service problem 59
Solving the probabilistic profitable tour problem on a line 55
The one-station bike repositioning problem 55
Kernel Search: A new heuristic framework for portfolio selection 49
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree 47
The impact of machine learning forecasting on strategic decision-making for bike sharing systems 10
Totale 13.162
Salva come PNG Salva come JPEG
Categoria #
all - tutte 51.454
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 51.454
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202128 0 0 0 0 0 0 0 0 0 0 0 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/20262.758 283 356 265 488 279 136 322 116 196 204 86 27
Totale 13.162