IRIS Institutional Research Information System - OPENBS Open Archive UniBS

ANGELELLI, Enrico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.117
EU - Europa 3.729
AS - Asia 866
AF - Africa 26
SA - Sud America 13
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 6
Totale 8.764
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.111
DE - Germania 1.318
RU - Federazione Russa 1.230
CN - Cina 624
UA - Ucraina 521
IT - Italia 298
HK - Hong Kong 166
FI - Finlandia 111
IE - Irlanda 86
GB - Regno Unito 67
FR - Francia 34
IN - India 20
BE - Belgio 19
SE - Svezia 16
GH - Ghana 15
SG - Singapore 10
TR - Turchia 10
BR - Brasile 9
PL - Polonia 8
EU - Europa 7
IR - Iran 7
AU - Australia 6
CA - Canada 5
VN - Vietnam 5
ES - Italia 4
ID - Indonesia 4
TW - Taiwan 4
MU - Mauritius 3
RO - Romania 3
AR - Argentina 2
AT - Austria 2
BY - Bielorussia 2
CZ - Repubblica Ceca 2
DZ - Algeria 2
HU - Ungheria 2
JP - Giappone 2
KZ - Kazakistan 2
MY - Malesia 2
NG - Nigeria 2
NL - Olanda 2
PH - Filippine 2
AM - Armenia 1
CO - Colombia 1
CV - Capo Verde 1
EG - Egitto 1
GE - Georgia 1
GR - Grecia 1
IL - Israele 1
IQ - Iraq 1
KE - Kenya 1
LA - Repubblica Popolare Democratica del Laos 1
MA - Marocco 1
ME - Montenegro 1
MX - Messico 1
OM - Oman 1
PT - Portogallo 1
RS - Serbia 1
SA - Arabia Saudita 1
TH - Thailandia 1
VE - Venezuela 1
Totale 8.764
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 220
Chandler 197
Hong Kong 166
Princeton 161
Nanjing 153
Brescia 138
Beijing 88
Dublin 86
Nürnberg 76
Dearborn 51
Nanchang 49
Helsinki 41
Hebei 39
Shenyang 37
Des Moines 36
Jinan 32
Changsha 31
Jiaxing 28
New York 28
San Diego 25
Milan 22
Tianjin 22
Brussels 19
Hangzhou 16
Accra 15
Ningbo 14
Shanghai 14
San Francisco 13
Zhengzhou 13
Kunming 11
Norwalk 11
Taizhou 11
Haikou 10
London 10
Lancaster 9
Bergamo 8
Taiyuan 8
Boardman 7
Kocaeli 7
Lanzhou 7
Verona 7
Desio 6
Wroclaw 6
Artogne 5
Guangzhou 5
Monza 5
Rende 5
Adelsdorf 4
Changchun 4
Chapecó 4
Chennai 4
Hanoi 4
Hefei 4
Indiana 4
Modena 4
Rome 4
Augusta 3
Dalmine 3
La Laguna 3
Magdeburg 3
Marseille 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
Lecco 2
Melbourne 2
Moscow 2
Orange 2
Palazzolo sull'Oglio 2
Pisa 2
Prague 2
Prescot 2
Qingdao 2
Redwood City 2
San Mateo 2
Santa Maria Capua Vetere 2
Sesto San Giovanni 2
Sydney 2
Taipei 2
Vienna 2
Totale 6.090
Salva come PNG Salva come JPEG
Nome #
A Dynamic Multi-Period Routing Problem 1.077
The stochastic and dynamic traveling purchaser problem 170
The probabilistic orienteering problem 156
The Traveling Purchaser Problem with time-dependent quantities 154
The Clustered Orienteering Problem 153
Maximum Expected Utility of Markovian Predicted Wealth 146
Congestion avoiding heuristic path generation for the proactive route guidance 145
Geometric representation for semi on-line scheduling on uniform processors 143
Timing portfolio strategies with exponential Lévy processes 140
Proactive route guidance to avoid congestion 136
The Stochastic and Dynamic Traveling Purchaser Problem 132
The Clustered Orienteering Problem 129
Comparison of policies in dynamic routing problems 129
A reclaimer scheduling problem arising in coal stockyard management 125
Kernel Search: A new heuristic framework for portfolio selection 123
Optimal interval scheduling with a resource constraint 123
A real-time vehicle routing model for a courier service problem 122
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 121
Look-ahead heuristics for the dynamic traveling purchaser problem 118
Kernel Search: A heuristic framework for MILP problems with binary variables 117
The application of a vehicle routing model to a waste collection problem: two case studies 115
Semi on-line scheduling on two parallel processors with upper bound on the items 115
Complexity and approximation for Traveling Salesman Problems with profits 115
Semi on-line scheduling on three processors with known sum of the tasks 114
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 112
On the complexity of interval scheduling with a resource constraint 112
Management policies in a dynamic multi-period routing problem 111
Short Term Strategies for a Dynamic Multi-period Routing Problem 110
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints 110
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 109
Short Term Strategies for a Dynamic Multi-Period Routing Problem 108
Financial Applications of Bivariate Markov Processes 108
The application of a vehicle routing model to a waste-collection problem: two case studies 107
The periodic vehicle routing problem with intermediate facilities 107
Comparison of policies in dynamic routing problems 107
Complexity and approximation for Traveling Salesman Problems with profits 107
Short Term Strategies for a Dynamic Multi-Period Routing Problem 104
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 104
Improved bounds for a semi on-line scheduling problem on two parallel processors 104
Set-Portfolio Selection with the Use of Market Stochastic Bounds 104
On the complexity of interval scheduling with a resource constraint 103
Exploring greedy criteria for the dynamic traveling purchaser problem 102
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 100
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 99
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 96
The on-line multiprocessor scheduling problem with known sum of the tasks 96
The Orienteering Problem with Set Constraints 94
American and European Portfolio Selection Strategies: The Markovian Approach 92
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 92
Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks 91
A dynamic multi-period routing problem 91
Volume-Return portfolio selection and large scale dimensional problems with bivariate Markov chains 91
A Dynamic Multi-Period Routing Problem 90
A comparison of Mad and CVaR with side constraints 89
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 86
The Dynamic Travelling Purchaser Problem 84
Some possible applications of bivariate Markov processes 79
The conditional value at risk with side constraints 78
The Dynamic Traveling Purchaser Problem 77
An asymptotic Markovian approach to the portfolio selection problem 77
The dynamic traveling purchaser problem 76
A comparison of MAD and CVaR with side constraints 75
International portfolio selection with Markov processes and liquidity constraints 75
American and European Portfolio Selection Strategies: The Markovian Approach 74
Core Search: An application to portfolio optimisation 73
Semi on-line scheduling on two uniform processors 69
Set-Portfolio Selection with the Use of Stochastic Bounds 68
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 66
GARCH type portfolio selection models with the Markovian approach 65
Dimensional portfolio reduction problems with asymptotic Markov processes 63
Portfolio Choice: A Non Parametric Markovian Framework 63
Semi on-line scheduling on two uniform processors 62
The Markovian portfolio selection model with GARCH volatility dynamics 62
On the application of Markov processes to the large scale portfolio selection problem 60
Semi on-line scheduling on two parallel processors with lower and upper bound on the tasks 58
Semi on-line scheduling on two uniform processors 57
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 55
A dynamic and probabilistic orienteering problem 49
Minimizing the total travel time with limited unfairness in traffic networks 31
A simulation framework for a station-based bike-sharing system 31
System optimal routing of traffic flows with user constraints using linear programming 30
A Matheuristic for the Air Transportation Freight Forwarder Service Problem 26
Optimization models for fair horizontal collaboration in demand-responsive transportation 12
A real-time vehicle routing model for a courier service problem 8
Kernel Search: A new heuristic framework for portfolio selection 7
Multi-day fair collaboration in demand-responsive transportation 6
Solving the probabilistic profitable tour problem on a line 5
Totale 8.975
Salva come PNG Salva come JPEG
Categoria #
all - tutte 29.141
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 29.141
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019375 0 0 0 0 0 0 0 0 0 0 193 182
2019/20201.901 286 47 60 235 102 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.414 34 13 31 34 18 45 34 447 643 106 9 0
Totale 8.975