IRIS Institutional Research Information System - OPENBS Open Archive UniBS

ANGELELLI, Enrico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.266
EU - Europa 3.889
AS - Asia 1.359
AF - Africa 28
SA - Sud America 17
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 7
Totale 9.574
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.260
DE - Germania 1.322
RU - Federazione Russa 1.303
CN - Cina 630
UA - Ucraina 521
IT - Italia 342
SG - Singapore 317
HK - Hong Kong 252
FI - Finlandia 115
IE - Irlanda 87
TR - Turchia 82
GB - Regno Unito 70
FR - Francia 36
IN - India 26
SE - Svezia 23
BE - Belgio 19
GH - Ghana 15
BR - Brasile 12
CZ - Repubblica Ceca 9
VN - Vietnam 9
AT - Austria 8
AU - Australia 8
PL - Polonia 8
EU - Europa 7
IR - Iran 7
CA - Canada 5
JP - Giappone 5
ES - Italia 4
ID - Indonesia 4
IL - Israele 4
NO - Norvegia 4
TW - Taiwan 4
AR - Argentina 3
MU - Mauritius 3
RO - Romania 3
BY - Bielorussia 2
DZ - Algeria 2
HU - Ungheria 2
KZ - Kazakistan 2
LK - Sri Lanka 2
MY - Malesia 2
NG - Nigeria 2
NL - Olanda 2
PH - Filippine 2
PT - Portogallo 2
SA - Arabia Saudita 2
SK - Slovacchia (Repubblica Slovacca) 2
TH - Thailandia 2
ZA - Sudafrica 2
AE - Emirati Arabi Uniti 1
AM - Armenia 1
BG - Bulgaria 1
CO - Colombia 1
CV - Capo Verde 1
DK - Danimarca 1
EG - Egitto 1
GE - Georgia 1
GR - Grecia 1
IQ - Iraq 1
JO - Giordania 1
KE - Kenya 1
LA - Repubblica Popolare Democratica del Laos 1
MA - Marocco 1
ME - Montenegro 1
MX - Messico 1
OM - Oman 1
RS - Serbia 1
VE - Venezuela 1
Totale 9.574
Salva come PNG Salva come JPEG
Città #
Ufa 991
Fairfield 656
Woodbridge 541
Houston 418
Jacksonville 382
Ann Arbor 313
Hong Kong 252
Seattle 241
Wilmington 236
Cambridge 231
Ashburn 223
Singapore 209
Chandler 197
Princeton 161
Nanjing 154
Brescia 146
Beijing 88
Dublin 87
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
London 11
Monza 11
Norwalk 11
Taizhou 11
Haikou 10
Boardman 9
Lancaster 9
Los Angeles 9
Bergamo 8
Taiyuan 8
Casamassima 7
Kocaeli 7
Lanzhou 7
Padova 7
Verona 7
Desio 6
Wroclaw 6
Artogne 5
Chicago 5
Desenzano del Garda 5
Guangzhou 5
Rende 5
Adelsdorf 4
Bengaluru 4
Changchun 4
Chapecó 4
Chennai 4
Hanoi 4
Hefei 4
Indiana 4
Modena 4
Počátky 4
Rome 4
Stockholm 4
Vienna 4
Augusta 3
Botucatu 3
Dalmine 3
Ho Chi Minh City 3
La Laguna 3
Linköping 3
Linz 3
Magdeburg 3
Marseille 3
Prague 3
Tokyo 3
Wuhan 3
Xi'an 3
Abbadia Lariana 2
Almaty 2
Amiens 2
Andover 2
Bratislava 2
Brisbane 2
Campinas 2
Canberra 2
Colombo 2
Concesio 2
Totale 6.565
Salva come PNG Salva come JPEG
Nome #
A Dynamic Multi-Period Routing Problem 1.086
The stochastic and dynamic traveling purchaser problem 175
The probabilistic orienteering problem 164
The Traveling Purchaser Problem with time-dependent quantities 161
The Clustered Orienteering Problem 160
Kernel Search: A heuristic framework for MILP problems with binary variables 159
Congestion avoiding heuristic path generation for the proactive route guidance 154
Maximum Expected Utility of Markovian Predicted Wealth 152
Geometric representation for semi on-line scheduling on uniform processors 149
Timing portfolio strategies with exponential Lévy processes 146
The Stochastic and Dynamic Traveling Purchaser Problem 144
Proactive route guidance to avoid congestion 142
Comparison of policies in dynamic routing problems 139
Kernel Search: A new heuristic framework for portfolio selection 136
The Clustered Orienteering Problem 134
Optimal interval scheduling with a resource constraint 134
A reclaimer scheduling problem arising in coal stockyard management 134
A real-time vehicle routing model for a courier service problem 132
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 130
Management policies in a dynamic multi-period routing problem 126
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints 125
Look-ahead heuristics for the dynamic traveling purchaser problem 124
Complexity and approximation for Traveling Salesman Problems with profits 124
The application of a vehicle routing model to a waste collection problem: two case studies 123
Semi on-line scheduling on two parallel processors with upper bound on the items 123
Short Term Strategies for a Dynamic Multi-period Routing Problem 121
Semi on-line scheduling on three processors with known sum of the tasks 120
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 120
Short Term Strategies for a Dynamic Multi-Period Routing Problem 120
Comparison of policies in dynamic routing problems 120
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 116
On the complexity of interval scheduling with a resource constraint 116
Complexity and approximation for Traveling Salesman Problems with profits 115
Exploring greedy criteria for the dynamic traveling purchaser problem 114
The application of a vehicle routing model to a waste-collection problem: two case studies 113
Short Term Strategies for a Dynamic Multi-Period Routing Problem 113
Financial Applications of Bivariate Markov Processes 113
The periodic vehicle routing problem with intermediate facilities 112
Improved bounds for a semi on-line scheduling problem on two parallel processors 112
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem 110
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 110
On the complexity of interval scheduling with a resource constraint 109
Set-Portfolio Selection with the Use of Market Stochastic Bounds 108
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 108
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 107
A comparison of Mad and CVaR with side constraints 106
Volume-Return portfolio selection and large scale dimensional problems with bivariate Markov chains 104
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 103
A dynamic multi-period routing problem 103
The on-line multiprocessor scheduling problem with known sum of the tasks 102
Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks 101
American and European Portfolio Selection Strategies: The Markovian Approach 99
The Orienteering Problem with Set Constraints 99
A Dynamic Multi-Period Routing Problem 98
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 91
A comparison of MAD and CVaR with side constraints 89
The Dynamic Travelling Purchaser Problem 89
The conditional value at risk with side constraints 87
American and European Portfolio Selection Strategies: The Markovian Approach 85
Some possible applications of bivariate Markov processes 85
An asymptotic Markovian approach to the portfolio selection problem 85
The Dynamic Traveling Purchaser Problem 84
The dynamic traveling purchaser problem 84
International portfolio selection with Markov processes and liquidity constraints 84
Core Search: An application to portfolio optimisation 80
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 78
Semi on-line scheduling on two uniform processors 77
A dynamic and probabilistic orienteering problem 76
Set-Portfolio Selection with the Use of Stochastic Bounds 74
Dimensional portfolio reduction problems with asymptotic Markov processes 73
GARCH type portfolio selection models with the Markovian approach 72
Semi on-line scheduling on two uniform processors 71
Portfolio Choice: A Non Parametric Markovian Framework 68
The Markovian portfolio selection model with GARCH volatility dynamics 67
Semi on-line scheduling on two parallel processors with lower and upper bound on the tasks 65
On the application of Markov processes to the large scale portfolio selection problem 65
Semi on-line scheduling on two uniform processors 63
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks 58
System optimal routing of traffic flows with user constraints using linear programming 44
A simulation framework for a station-based bike-sharing system 43
Minimizing the total travel time with limited unfairness in traffic networks 42
A Matheuristic for the Air Transportation Freight Forwarder Service Problem 36
A real-time vehicle routing model for a courier service problem 23
Optimization models for fair horizontal collaboration in demand-responsive transportation 22
Multi-day fair collaboration in demand-responsive transportation 17
Kernel Search: A new heuristic framework for portfolio selection 17
Solving the probabilistic profitable tour problem on a line 15
The one-station bike repositioning problem 11
Totale 9.788
Salva come PNG Salva come JPEG
Categoria #
all - tutte 38.541
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 38.541
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020559 0 0 0 0 0 0 0 0 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/2025726 13 19 13 145 168 121 114 32 101 0 0 0
Totale 9.788