IRIS Institutional Research Information System - OPENBS Open Archive UniBS

ANGELELLI, Enrico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.234
EU - Europa 3.858
AS - Asia 1.179
AF - Africa 28
SA - Sud America 17
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 6
Totale 9.329
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.228
DE - Germania 1.322
RU - Federazione Russa 1.303
CN - Cina 630
UA - Ucraina 521
IT - Italia 327
SG - Singapore 230
HK - Hong Kong 166
FI - Finlandia 115
IE - Irlanda 86
TR - Turchia 82
GB - Regno Unito 69
FR - Francia 34
IN - India 25
BE - Belgio 19
SE - Svezia 19
GH - Ghana 15
BR - Brasile 12
PL - Polonia 8
VN - Vietnam 8
AT - Austria 7
EU - Europa 7
IR - Iran 7
AU - Australia 6
CZ - Repubblica Ceca 6
CA - Canada 5
JP - Giappone 5
ES - Italia 4
ID - Indonesia 4
TW - Taiwan 4
AR - Argentina 3
MU - Mauritius 3
NO - Norvegia 3
RO - Romania 3
BY - Bielorussia 2
DZ - Algeria 2
HU - Ungheria 2
IL - Israele 2
KZ - Kazakistan 2
MY - Malesia 2
NG - Nigeria 2
NL - Olanda 2
PH - Filippine 2
SA - Arabia Saudita 2
TH - Thailandia 2
ZA - Sudafrica 2
AM - Armenia 1
CO - Colombia 1
CV - Capo Verde 1
DK - Danimarca 1
EG - Egitto 1
GE - Georgia 1
GR - Grecia 1
IQ - Iraq 1
KE - Kenya 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
MA - Marocco 1
ME - Montenegro 1
MX - Messico 1
OM - Oman 1
PT - Portogallo 1
RS - Serbia 1
SK - Slovacchia (Repubblica Slovacca) 1
VE - Venezuela 1
Totale 9.329
Salva come PNG Salva come JPEG
Città #
Ufa 991
Fairfield 656
Woodbridge 541
Houston 418
Jacksonville 382
Ann Arbor 313
Seattle 241
Wilmington 236
Cambridge 231
Ashburn 223
Chandler 197
Singapore 186
Hong Kong 166
Princeton 161
Nanjing 154
Brescia 143
Beijing 88
Dublin 86
Nürnberg 76
Istanbul 73
Dearborn 51
Nanchang 49
Moscow 45
Helsinki 44
Hebei 39
Shenyang 37
Des Moines 36
Jinan 32
Changsha 31
Jiaxing 28
New York 28
San Diego 25
Milan 23
Tianjin 22
Brussels 19
Shanghai 19
Hangzhou 16
Accra 15
Ningbo 14
San Francisco 13
Zhengzhou 13
Kunming 11
Norwalk 11
Taizhou 11
Haikou 10
London 10
Boardman 9
Lancaster 9
Bergamo 8
Taiyuan 8
Casamassima 7
Kocaeli 7
Lanzhou 7
Verona 7
Desio 6
Monza 6
Padova 6
Wroclaw 6
Artogne 5
Guangzhou 5
Rende 5
Adelsdorf 4
Bengaluru 4
Changchun 4
Chapecó 4
Chennai 4
Hanoi 4
Hefei 4
Indiana 4
Los Angeles 4
Modena 4
Počátky 4
Rome 4
Vienna 4
Augusta 3
Botucatu 3
Dalmine 3
Ho Chi Minh City 3
La Laguna 3
Linz 3
Magdeburg 3
Marseille 3
Stockholm 3
Tokyo 3
Wuhan 3
Xi'an 3
Abbadia Lariana 2
Almaty 2
Andover 2
Campinas 2
Canberra 2
Concesio 2
Denpasar 2
Duisburg 2
Fuzhou 2
Isola della Scala 2
João Pessoa 2
Krasnoyarsk 2
Lappeenranta 2
Lecco 2
Totale 6.431
Salva come PNG Salva come JPEG
Nome #
A Dynamic Multi-Period Routing Problem 1.085
The stochastic and dynamic traveling purchaser problem 175
The probabilistic orienteering problem 163
The Traveling Purchaser Problem with time-dependent quantities 160
The Clustered Orienteering Problem 159
Maximum Expected Utility of Markovian Predicted Wealth 151
Congestion avoiding heuristic path generation for the proactive route guidance 150
Geometric representation for semi on-line scheduling on uniform processors 147
Timing portfolio strategies with exponential Lévy processes 145
Kernel Search: A heuristic framework for MILP problems with binary variables 144
The Stochastic and Dynamic Traveling Purchaser Problem 142
Proactive route guidance to avoid congestion 140
Comparison of policies in dynamic routing problems 136
Kernel Search: A new heuristic framework for portfolio selection 134
The Clustered Orienteering Problem 134
A reclaimer scheduling problem arising in coal stockyard management 131
A real-time vehicle routing model for a courier service problem 129
Optimal interval scheduling with a resource constraint 129
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 127
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints 124
Look-ahead heuristics for the dynamic traveling purchaser problem 123
Semi on-line scheduling on two parallel processors with upper bound on the items 120
Management policies in a dynamic multi-period routing problem 120
Complexity and approximation for Traveling Salesman Problems with profits 120
The application of a vehicle routing model to a waste collection problem: two case studies 119
Semi on-line scheduling on three processors with known sum of the tasks 117
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 117
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 115
Short Term Strategies for a Dynamic Multi-period Routing Problem 115
Short Term Strategies for a Dynamic Multi-Period Routing Problem 115
On the complexity of interval scheduling with a resource constraint 115
Comparison of policies in dynamic routing problems 114
Financial Applications of Bivariate Markov Processes 113
The application of a vehicle routing model to a waste-collection problem: two case studies 112
Complexity and approximation for Traveling Salesman Problems with profits 112
The periodic vehicle routing problem with intermediate facilities 111
Exploring greedy criteria for the dynamic traveling purchaser problem 111
Short Term Strategies for a Dynamic Multi-Period Routing Problem 110
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 109
Improved bounds for a semi on-line scheduling problem on two parallel processors 108
On the complexity of interval scheduling with a resource constraint 108
Set-Portfolio Selection with the Use of Market Stochastic Bounds 108
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 107
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 105
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 102
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 102
A dynamic multi-period routing problem 100
A comparison of Mad and CVaR with side constraints 100
Volume-Return portfolio selection and large scale dimensional problems with bivariate Markov chains 99
The on-line multiprocessor scheduling problem with known sum of the tasks 99
Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks 98
American and European Portfolio Selection Strategies: The Markovian Approach 97
A Dynamic Multi-Period Routing Problem 97
The Orienteering Problem with Set Constraints 97
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 91
The Dynamic Travelling Purchaser Problem 88
A comparison of MAD and CVaR with side constraints 84
Some possible applications of bivariate Markov processes 84
The conditional value at risk with side constraints 83
An asymptotic Markovian approach to the portfolio selection problem 83
The Dynamic Traveling Purchaser Problem 82
The dynamic traveling purchaser problem 81
American and European Portfolio Selection Strategies: The Markovian Approach 81
International portfolio selection with Markov processes and liquidity constraints 81
Core Search: An application to portfolio optimisation 77
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 75
Semi on-line scheduling on two uniform processors 73
Set-Portfolio Selection with the Use of Stochastic Bounds 72
Dimensional portfolio reduction problems with asymptotic Markov processes 72
GARCH type portfolio selection models with the Markovian approach 69
Semi on-line scheduling on two uniform processors 67
The Markovian portfolio selection model with GARCH volatility dynamics 67
Portfolio Choice: A Non Parametric Markovian Framework 67
On the application of Markov processes to the large scale portfolio selection problem 65
A dynamic and probabilistic orienteering problem 64
Semi on-line scheduling on two parallel processors with lower and upper bound on the tasks 63
Semi on-line scheduling on two uniform processors 62
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 58
A simulation framework for a station-based bike-sharing system 41
System optimal routing of traffic flows with user constraints using linear programming 39
Minimizing the total travel time with limited unfairness in traffic networks 36
A Matheuristic for the Air Transportation Freight Forwarder Service Problem 34
A real-time vehicle routing model for a courier service problem 19
Optimization models for fair horizontal collaboration in demand-responsive transportation 16
Kernel Search: A new heuristic framework for portfolio selection 14
Solving the probabilistic profitable tour problem on a line 13
Multi-day fair collaboration in demand-responsive transportation 12
The one-station bike repositioning problem 8
Totale 9.541
Salva come PNG Salva come JPEG
Categoria #
all - tutte 36.028
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 36.028
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.171 0 0 0 0 0 210 211 191 127 265 61 106
2020/20211.091 17 125 25 141 49 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/2025479 13 19 13 145 168 121 0 0 0 0 0 0
Totale 9.541