IRIS Institutional Research Information System - OPENBS Open Archive UniBS

ANGELELLI, Enrico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.114
EU - Europa 4.266
AS - Asia 2.748
SA - Sud America 523
Continente sconosciuto - Info sul continente non disponibili 225
AF - Africa 85
OC - Oceania 11
Totale 13.972
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.006
DE - Germania 1.350
RU - Federazione Russa 1.318
CN - Cina 1.007
SG - Singapore 904
UA - Ucraina 531
IT - Italia 438
BR - Brasile 427
HK - Hong Kong 313
VN - Vietnam 162
FR - Francia 128
GB - Regno Unito 123
FI - Finlandia 121
TR - Turchia 99
IE - Irlanda 87
IN - India 76
CA - Canada 49
AR - Argentina 39
BD - Bangladesh 38
SE - Svezia 34
IQ - Iraq 21
ES - Italia 20
BE - Belgio 19
JP - Giappone 17
MX - Messico 16
PL - Polonia 16
AT - Austria 15
GH - Ghana 15
ZA - Sudafrica 15
NG - Nigeria 14
CO - Colombia 13
DZ - Algeria 13
EC - Ecuador 12
ID - Indonesia 12
PK - Pakistan 12
AU - Australia 11
CZ - Repubblica Ceca 11
SA - Arabia Saudita 11
UZ - Uzbekistan 11
VE - Venezuela 11
NL - Olanda 10
DK - Danimarca 9
IL - Israele 9
LT - Lituania 9
CL - Cile 8
TT - Trinidad e Tobago 8
EU - Europa 7
IR - Iran 7
KE - Kenya 7
AZ - Azerbaigian 6
JM - Giamaica 6
PH - Filippine 6
RO - Romania 6
BB - Barbados 5
NO - Norvegia 5
PY - Paraguay 5
SV - El Salvador 5
CR - Costa Rica 4
JO - Giordania 4
KZ - Kazakistan 4
LB - Libano 4
PE - Perù 4
TW - Taiwan 4
BG - Bulgaria 3
EG - Egitto 3
HN - Honduras 3
HU - Ungheria 3
LK - Sri Lanka 3
MA - Marocco 3
MU - Mauritius 3
MY - Malesia 3
NI - Nicaragua 3
SC - Seychelles 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
OM - Oman 2
PR - Porto Rico 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
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
Totale 13.748
Salva come PNG Salva come JPEG
Città #
Ufa 991
Fairfield 656
Woodbridge 541
Singapore 478
Houston 422
Ashburn 412
Jacksonville 382
Ann Arbor 313
Hong Kong 311
San Jose 255
Seattle 249
Wilmington 237
Cambridge 231
Chandler 197
The Dalles 177
Beijing 164
Princeton 162
Brescia 160
Council Bluffs 155
Nanjing 154
Dublin 87
Los Angeles 86
Columbus 81
Istanbul 76
Nürnberg 76
Lauterbourg 72
Ho Chi Minh City 65
New York 56
Dearborn 51
Helsinki 49
Nanchang 49
Moscow 46
São Paulo 46
Hanoi 42
Dallas 39
Hebei 39
Des Moines 38
Changsha 37
Shenyang 37
Buffalo 35
Chicago 34
Jinan 32
Santa Clara 32
Milan 30
San Francisco 30
Tianjin 30
Jiaxing 29
San Diego 26
Shanghai 25
Phoenix 24
Redondo Beach 22
Orem 21
Brussels 19
Montreal 19
Chennai 18
Rio de Janeiro 18
Hangzhou 17
North Bergen 16
Accra 15
London 15
Naples 15
Brooklyn 14
Ningbo 14
Stockholm 14
Zhengzhou 14
Lancaster 13
Tokyo 13
Abuja 12
Atlanta 12
Manchester 12
Monza 12
Boardman 11
Denver 11
Haikou 11
Kunming 11
Norwalk 11
Porto Alegre 11
Taizhou 11
Baghdad 10
Belo Horizonte 10
Boston 10
Guangzhou 10
Lanzhou 10
Johannesburg 9
Mumbai 9
Philadelphia 9
Taiyuan 9
Bergamo 8
Rome 8
Tashkent 8
Vienna 8
Casamassima 7
Charlottesville 7
Curitiba 7
Desenzano del Garda 7
Frankfurt am Main 7
Haiphong 7
Hải Dương 7
Kocaeli 7
Kongens Lyngby 7
Totale 8.629
Salva come PNG Salva come JPEG
Nome #
A Dynamic Multi-Period Routing Problem 1.118
Kernel Search: A heuristic framework for MILP problems with binary variables 252
The stochastic and dynamic traveling purchaser problem 226
Optimal interval scheduling with a resource constraint 217
The probabilistic orienteering problem 210
Congestion avoiding heuristic path generation for the proactive route guidance 208
The Stochastic and Dynamic Traveling Purchaser Problem 204
Proactive route guidance to avoid congestion 204
The Traveling Purchaser Problem with time-dependent quantities 204
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints 200
A real-time vehicle routing model for a courier service problem 190
The Clustered Orienteering Problem 190
Geometric representation for semi on-line scheduling on uniform processors 186
The Clustered Orienteering Problem 186
A reclaimer scheduling problem arising in coal stockyard management 186
Comparison of policies in dynamic routing problems 186
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 185
Kernel Search: A new heuristic framework for portfolio selection 185
Management policies in a dynamic multi-period routing problem 182
A comparison of Mad and CVaR with side constraints 182
Look-ahead heuristics for the dynamic traveling purchaser problem 182
Maximum Expected Utility of Markovian Predicted Wealth 180
Timing portfolio strategies with exponential Lévy processes 180
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 177
Short Term Strategies for a Dynamic Multi-Period Routing Problem 176
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 171
Short Term Strategies for a Dynamic Multi-Period Routing Problem 169
Comparison of policies in dynamic routing problems 168
Short Term Strategies for a Dynamic Multi-period Routing Problem 166
American and European Portfolio Selection Strategies: The Markovian Approach 163
Exploring greedy criteria for the dynamic traveling purchaser problem 161
The application of a vehicle routing model to a waste collection problem: two case studies 160
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 158
Financial Applications of Bivariate Markov Processes 156
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 154
A comparison of MAD and CVaR with side constraints 154
Improved bounds for a semi on-line scheduling problem on two parallel processors 153
A dynamic multi-period routing problem 152
Semi on-line scheduling on three processors with known sum of the tasks 151
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 151
The application of a vehicle routing model to a waste-collection problem: two case studies 149
On the complexity of interval scheduling with a resource constraint 149
Complexity and approximation for Traveling Salesman Problems with profits 149
Complexity and approximation for Traveling Salesman Problems with profits 148
The periodic vehicle routing problem with intermediate facilities 147
On the complexity of interval scheduling with a resource constraint 146
Volume-Return portfolio selection and large scale dimensional problems with bivariate Markov chains 146
A dynamic and probabilistic orienteering problem 146
Semi on-line scheduling on two parallel processors with upper bound on the items 145
A Dynamic Multi-Period Routing Problem 145
Set-Portfolio Selection with the Use of Market Stochastic Bounds 143
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 142
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 142
The dynamic traveling purchaser problem 140
The Orienteering Problem with Set Constraints 138
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 137
Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks 135
The Dynamic Travelling Purchaser Problem 135
American and European Portfolio Selection Strategies: The Markovian Approach 133
The on-line multiprocessor scheduling problem with known sum of the tasks 133
An asymptotic Markovian approach to the portfolio selection problem 132
The conditional value at risk with side constraints 127
The Dynamic Traveling Purchaser Problem 121
Some possible applications of bivariate Markov processes 121
International portfolio selection with Markov processes and liquidity constraints 121
Core Search: An application to portfolio optimisation 114
Set-Portfolio Selection with the Use of Stochastic Bounds 114
Semi on-line scheduling on two uniform processors 113
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 113
The Markovian portfolio selection model with GARCH volatility dynamics 109
Dimensional portfolio reduction problems with asymptotic Markov processes 108
Semi on-line scheduling on two uniform processors 106
Portfolio Choice: A Non Parametric Markovian Framework 104
Minimizing the total travel time with limited unfairness in traffic networks 104
A simulation framework for a station-based bike-sharing system 104
GARCH type portfolio selection models with the Markovian approach 102
System optimal routing of traffic flows with user constraints using linear programming 102
Multi-day fair collaboration in demand-responsive transportation 101
Semi on-line scheduling on two uniform processors 101
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 101
On the application of Markov processes to the large scale portfolio selection problem 97
A Matheuristic for the Air Transportation Freight Forwarder Service Problem 97
Semi on-line scheduling on two parallel processors with lower and upper bound on the tasks 93
Solving the probabilistic profitable tour problem on a line 80
Optimization models for fair horizontal collaboration in demand-responsive transportation 75
A real-time vehicle routing model for a courier service problem 71
The one-station bike repositioning problem 65
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree 62
Kernel Search: A new heuristic framework for portfolio selection 57
The impact of machine learning forecasting on strategic decision-making for bike sharing systems 26
Totale 13.972
Salva come PNG Salva come JPEG
Categoria #
all - tutte 56.225
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 56.225
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022406 0 0 0 0 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/2027798 148 131 174 330 15 0 0 0 0 0 0 0
Totale 13.972