IRIS Institutional Research Information System - OPENBS Open Archive UniBS

MANSINI, Renata
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.646
EU - Europa 3.165
AS - Asia 1.803
SA - Sud America 23
AF - Africa 16
Continente sconosciuto - Info sul continente non disponibili 13
OC - Oceania 11
Totale 11.677
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.622
CN - Cina 1.204
UA - Ucraina 843
DE - Germania 780
IT - Italia 612
HK - Hong Kong 258
FI - Finlandia 200
SG - Singapore 173
IE - Irlanda 153
PL - Polonia 139
GB - Regno Unito 110
RU - Federazione Russa 93
FR - Francia 59
IN - India 46
PT - Portogallo 37
TR - Turchia 37
BE - Belgio 25
IR - Iran 25
SE - Svezia 23
CA - Canada 22
DK - Danimarca 19
NL - Olanda 18
ES - Italia 15
BR - Brasile 14
EU - Europa 13
JP - Giappone 12
AU - Australia 11
VN - Vietnam 11
AT - Austria 9
GR - Grecia 7
TW - Taiwan 7
CL - Cile 6
CZ - Repubblica Ceca 5
ID - Indonesia 5
HU - Ungheria 4
SA - Arabia Saudita 4
ZA - Sudafrica 4
CH - Svizzera 3
MU - Mauritius 3
MY - Malesia 3
NO - Norvegia 3
RO - Romania 3
TH - Thailandia 3
AL - Albania 2
AR - Argentina 2
DZ - Algeria 2
KE - Kenya 2
KR - Corea 2
KZ - Kazakistan 2
MA - Marocco 2
MX - Messico 2
NG - Nigeria 2
AE - Emirati Arabi Uniti 1
AM - Armenia 1
CO - Colombia 1
EG - Egitto 1
GE - Georgia 1
IL - Israele 1
IQ - Iraq 1
JO - Giordania 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
LU - Lussemburgo 1
ME - Montenegro 1
OM - Oman 1
PH - Filippine 1
RS - Serbia 1
TJ - Tagikistan 1
Totale 11.677
Salva come PNG Salva come JPEG
Città #
Fairfield 956
Woodbridge 759
Jacksonville 619
Ann Arbor 586
Houston 572
Ashburn 397
Seattle 365
Wilmington 358
Cambridge 354
Chandler 327
Princeton 278
Hong Kong 248
Nanjing 243
Beijing 220
Brescia 214
Dublin 149
Warsaw 138
Dearborn 106
Singapore 104
Helsinki 99
New York 82
Nanchang 77
Jinan 72
Shenyang 71
Des Moines 65
Changsha 57
Shanghai 56
Boardman 53
Hebei 51
Milan 50
San Diego 50
Tianjin 44
Jiaxing 40
Hangzhou 28
Verona 28
Zhengzhou 28
Nürnberg 27
Lisbon 26
Ningbo 26
Brussels 23
London 21
San Francisco 21
Taizhou 21
Kocaeli 20
Haikou 19
Kunming 18
Los Angeles 17
Toronto 17
Rome 15
Taiyuan 15
Lanzhou 14
Wuhan 13
Guangzhou 12
Redwood City 12
Romola 12
Verolanuova 12
Dong Ket 10
Falls Church 9
Hefei 9
Mira 9
Changchun 8
Fairfax 8
Indiana 8
Norwalk 8
Worcester 8
Amsterdam 7
Bergamo 7
Centrale 7
Kilburn 7
Lappeenranta 7
Tehran 7
Augsburg 6
Bussolengo 6
Detmold 6
Ferrara 6
Lancaster 6
Marietta 6
Montalto Uffugo 6
Taipei 6
Tokyo 6
Fuzhou 5
Magdeburg 5
Melbourne 5
Orzinuovi 5
Ospitaletto 5
Patras 5
São Paulo 5
Vienna 5
Würzburg 5
Aarhus 4
Adelsdorf 4
Bengaluru 4
Budapest 4
Chapecó 4
Como 4
Dalmine 4
Kolkata 4
Muenster 4
Orange 4
Porto 4
Totale 8.567
Salva come PNG Salva come JPEG
Nome #
A Granular Variable Neighborhood Search Heuristic for the Tour Orienteering Problem with Time Windows 343
The stochastic and dynamic traveling purchaser problem 171
A Kernel Search for a Patient Satisfaction-oriented Nurse Routing Problem with Time-Windows 164
New rate adaptation method for JPEG2000-based SNR Scalable Video Coding with Integer Linear Programming models 161
The Traveling Purchaser Problem with time-dependent quantities 155
Linear and mixed integer programming for portfolio optimization 154
Attended Home Delivery: reducing last-mile environmental impact by changing customer habits 139
Kernel Search: A heuristic framework for MILP problems with binary variables 134
The Stochastic and Dynamic Traveling Purchaser Problem 134
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem 133
The Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands: A Branch-and-Price Approach 132
Mixed integer linear programming models for optimal crop selection 131
Comparison of policies in dynamic routing problems 130
A Stochastic Programming Approach for the Traveling Purchaser Problem 128
The Capacitated Supplier Selection problem with Total Quantity Discount policy and Activation Costs under uncertainty 127
Kernel Search: A new heuristic framework for portfolio selection 124
The Traveling Purchaser Problem and its variants 124
A real-time vehicle routing model for a courier service problem 123
CORAL: An exact algorithm for the Multidimensional Knapsack Problem 122
Look-ahead heuristics for the dynamic traveling purchaser problem 120
The Distance Constrained Multiple Vehicle Traveling Purchaser Problem 117
Twenty years of linear programming based portfolio optimization 117
Modeling the pre-auction stage: the truckload case 116
The Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands: A Branch-and-Price Approach 115
Management policies in a dynamic multi-period routing problem 113
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 110
Short Term Strategies for a Dynamic Multi-period Routing Problem 110
Short Term Strategies for a Dynamic Multi-Period Routing Problem 110
An Effective Matheuristic for the Capacitated Total Quantity Discount Problem 110
A Branch-and-Cut Algorithm for the Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints 110
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem 110
Comparison of policies in dynamic routing problems 108
Exploring greedy criteria for the dynamic traveling purchaser problem 107
Optimizing the physician scheduling problem in a large hospital ward 107
Short Term Strategies for a Dynamic Multi-Period Routing Problem 106
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 105
An exact algorithm for the Capacitated Total Quantity Discount Problem 105
A branch-and-bound algorithm for the time-Dependent rural postman problem 105
An exact approach for portfolio selection with transaction costs and rounds 104
A linear programming model for the separate refuse collection service 104
Models and simulations for portfolio rebalancing 103
Heuristic Algorithms for the Portfolio Selection Problem with Minimum Transaction Lots 101
The Traveling Purchaser Problem with Budget Constraint 101
Improving spare parts management for field services. A model and a case study for the repair kit problem 101
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 100
The Hierarchical Mixed Rural Postman Problem 100
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 98
The Nurse Routing Problem with Workload Constraints and Incompatible Services 98
An Efficient Fully Polynomial Approximation Scheme for the Subset-Sum Problem 96
An efficient fully polynomial approximation scheme for the subset-sum problem 96
Vehicle Purchaser Problem with Exclusionary Side Constraints 95
A comparison of Mad and CVaR with side constraints 94
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 94
Portfolio optimization and transaction costs 94
Two Linear Approximation Algorithms for the Subset-Sum Problem 93
Semi-absolute deviation rule for mutual funds portfolio selection 93
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search 93
The supplier selection problem with quantity discounts and truckload shipping 93
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm 93
Complexity and reducibility of the skip delivery problem 93
On the effectiveness of scenario generation techniques in single-period portfolio optimization 92
Optimizing the daily schedule of a wellness center 91
LP solvable models for portfolio optimization: a classification and computational comparison 90
The generalized independent set problem: Polyhedral analysis and solution approaches 90
A Multidimensional Knapsack Model for Asset-Backed Securitization 89
The directed profitable rural postman problem with incompatibility constraints 89
The multi-visit team orienteering problem with precedence constraints 89
A model and solution algorithm for the Repair Kit Problem: An empirical application 88
An Adaptive Large Neighborhood Search Approach for the Physician Scheduling Problem 88
Scheduling groups of tasks with precedence constraints on three dedicated processors 87
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 87
On Selecting a Portfolio of Lease Contracts in an Asset-Backed Securitization Process 86
Effective Algorithms for a Bounded Version of the Uncapacitated TPP 85
The Dynamic Travelling Purchaser Problem 85
A branch-and-cut algorithm for the Team Orienteering Problem 84
New results for the Directed Profitable Rural Postman Problem 81
The conditional value at risk with side constraints 79
The Dynamic Traveling Purchaser Problem 78
A comparison of MAD and CVaR with side constraints 78
Conditional value at risk and related linear programming models for portfolio optimization 78
The dynamic traveling purchaser problem 78
Securitization of Financial Assets: Approximation in Theory and Practice 77
The Split Delivery Vehicle Routing Problem with Small Capacity 75
Core Search: An application to portfolio optimisation 74
The Vehicle Routing Problem with Double and Triple Capacity, General Distances and Multiple Customer Visits 70
The Distance-Constrained Vehicle Purchaser Problem 70
Enhanced index tracking with CVaR-based ratio measures 68
An effective tabu search algorithm for the capacitated travelling purchaser problem 67
Multi-visit Clustered Team Orienteering Problem 65
A branch-and-price algorithm for the Multi-Vehicle Travelling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands 64
An exact algorithm for the Multidimensional Multiple-Choice Knapsack Problem 64
A Multidimensional Knapsack Model for the Selection of Contracts in an Asset-Backed Securitization 63
An effective hybrid heuristic for the Capacitated Total Quantity Discount Problem 63
A column generation approach for the Multi-Vehicle Travelling Purchaser Problem with Pairwise Incompatibility Constraints 63
The Multi-Vehicle Traveling Purchaser Problem with Exclusionary Side Constraints 63
Selezione di Portafoglio con Costi di Transazione 62
Multi-Vehicle Traveling Purchaser Problem with Exclusionary Side Constraints 61
Exact algorithm for the Total Quantity Discount Problem 61
A New Exact Algorithm for the Multidimensional Multiple-Choice Knapsack Problem 60
Vendor selection: optimizing procurement and shipping costs 59
Totale 10.108
Salva come PNG Salva come JPEG
Categoria #
all - tutte 54.628
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 54.628
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.833 0 0 100 374 169 393 359 320 219 555 157 187
2020/20211.791 35 217 39 218 97 213 58 219 250 210 171 64
2021/20221.053 58 186 39 33 13 45 71 90 61 97 92 268
2022/20231.075 160 13 20 103 105 276 19 102 163 30 41 43
2023/20241.104 67 31 60 107 41 98 75 40 270 28 43 244
2024/2025123 28 34 61 0 0 0 0 0 0 0 0 0
Totale 12.081