IRIS Institutional Research Information System - OPENBS Open Archive UniBS

MANSINI, Renata
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.828
EU - Europa 3.199
AS - Asia 2.174
SA - Sud America 26
AF - Africa 16
Continente sconosciuto - Info sul continente non disponibili 13
OC - Oceania 11
Totale 12.267
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.803
CN - Cina 1.204
UA - Ucraina 843
DE - Germania 785
IT - Italia 632
SG - Singapore 396
HK - Hong Kong 258
FI - Finlandia 200
TR - Turchia 176
IE - Irlanda 153
PL - Polonia 139
GB - Regno Unito 110
RU - Federazione Russa 96
FR - Francia 59
IN - India 46
PT - Portogallo 37
BE - Belgio 25
IR - Iran 25
CA - Canada 23
SE - Svezia 23
DK - Danimarca 20
NL - Olanda 18
BR - Brasile 17
ES - Italia 16
EU - Europa 13
ID - Indonesia 12
JP - Giappone 12
AU - Australia 11
VN - Vietnam 11
AT - Austria 9
CZ - Repubblica Ceca 9
GR - Grecia 7
TW - Taiwan 7
CL - Cile 6
HU - Ungheria 4
SA - Arabia Saudita 4
ZA - Sudafrica 4
CH - Svizzera 3
MU - Mauritius 3
MY - Malesia 3
NO - Norvegia 3
PH - Filippine 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
RS - Serbia 1
TJ - Tagikistan 1
Totale 12.267
Salva come PNG Salva come JPEG
Città #
Fairfield 956
Woodbridge 759
Jacksonville 619
Ann Arbor 586
Houston 572
Ashburn 399
Seattle 365
Wilmington 358
Cambridge 354
Chandler 327
Singapore 319
Princeton 278
Hong Kong 248
Nanjing 243
Brescia 222
Beijing 220
Dublin 149
Warsaw 138
Istanbul 134
Dearborn 106
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
Ankara 7
Bergamo 7
Centrale 7
Jakarta 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
Totale 8.928
Salva come PNG Salva come JPEG
Nome #
A Granular Variable Neighborhood Search Heuristic for the Tour Orienteering Problem with Time Windows 354
The stochastic and dynamic traveling purchaser problem 174
A Kernel Search for a Patient Satisfaction-oriented Nurse Routing Problem with Time-Windows 168
New rate adaptation method for JPEG2000-based SNR Scalable Video Coding with Integer Linear Programming models 167
Linear and mixed integer programming for portfolio optimization 159
The Traveling Purchaser Problem with time-dependent quantities 158
Attended Home Delivery: reducing last-mile environmental impact by changing customer habits 142
Kernel Search: A heuristic framework for MILP problems with binary variables 141
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem 138
The Stochastic and Dynamic Traveling Purchaser Problem 137
Mixed integer linear programming models for optimal crop selection 135
The Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands: A Branch-and-Price Approach 134
Comparison of policies in dynamic routing problems 133
The Capacitated Supplier Selection problem with Total Quantity Discount policy and Activation Costs under uncertainty 132
A Stochastic Programming Approach for the Traveling Purchaser Problem 131
Kernel Search: A new heuristic framework for portfolio selection 129
A real-time vehicle routing model for a courier service problem 127
The Traveling Purchaser Problem and its variants 127
Twenty years of linear programming based portfolio optimization 126
CORAL: An exact algorithm for the Multidimensional Knapsack Problem 125
Look-ahead heuristics for the dynamic traveling purchaser problem 122
A Branch-and-Cut Algorithm for the Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints 121
The Distance Constrained Multiple Vehicle Traveling Purchaser Problem 120
Modeling the pre-auction stage: the truckload case 119
Management policies in a dynamic multi-period routing problem 118
The Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands: A Branch-and-Price Approach 118
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 114
Short Term Strategies for a Dynamic Multi-Period Routing Problem 114
Short Term Strategies for a Dynamic Multi-period Routing Problem 113
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem 113
An Effective Matheuristic for the Capacitated Total Quantity Discount Problem 112
Comparison of policies in dynamic routing problems 111
Exploring greedy criteria for the dynamic traveling purchaser problem 110
Optimizing the physician scheduling problem in a large hospital ward 110
Short Term Strategies for a Dynamic Multi-Period Routing Problem 109
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 108
An exact algorithm for the Capacitated Total Quantity Discount Problem 108
A branch-and-bound algorithm for the time-Dependent rural postman problem 108
A linear programming model for the separate refuse collection service 108
An exact approach for portfolio selection with transaction costs and rounds 107
Models and simulations for portfolio rebalancing 106
The Traveling Purchaser Problem with Budget Constraint 103
Semi-absolute deviation rule for mutual funds portfolio selection 103
Improving spare parts management for field services. A model and a case study for the repair kit problem 103
The Hierarchical Mixed Rural Postman Problem 103
An Efficient Fully Polynomial Approximation Scheme for the Subset-Sum Problem 102
Heuristic Algorithms for the Portfolio Selection Problem with Minimum Transaction Lots 102
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 102
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 101
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 101
Vehicle Purchaser Problem with Exclusionary Side Constraints 101
The Nurse Routing Problem with Workload Constraints and Incompatible Services 100
An efficient fully polynomial approximation scheme for the subset-sum problem 99
A comparison of Mad and CVaR with side constraints 98
The supplier selection problem with quantity discounts and truckload shipping 97
Two Linear Approximation Algorithms for the Subset-Sum Problem 96
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search 96
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm 96
Complexity and reducibility of the skip delivery problem 96
Portfolio optimization and transaction costs 95
On the effectiveness of scenario generation techniques in single-period portfolio optimization 95
A Multidimensional Knapsack Model for Asset-Backed Securitization 93
LP solvable models for portfolio optimization: a classification and computational comparison 93
A model and solution algorithm for the Repair Kit Problem: An empirical application 93
Optimizing the daily schedule of a wellness center 93
The generalized independent set problem: Polyhedral analysis and solution approaches 93
The directed profitable rural postman problem with incompatibility constraints 92
The multi-visit team orienteering problem with precedence constraints 92
An Adaptive Large Neighborhood Search Approach for the Physician Scheduling Problem 91
Scheduling groups of tasks with precedence constraints on three dedicated processors 90
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 90
On Selecting a Portfolio of Lease Contracts in an Asset-Backed Securitization Process 89
Effective Algorithms for a Bounded Version of the Uncapacitated TPP 89
The Dynamic Travelling Purchaser Problem 87
A branch-and-cut algorithm for the Team Orienteering Problem 87
New results for the Directed Profitable Rural Postman Problem 84
The Dynamic Traveling Purchaser Problem 82
A comparison of MAD and CVaR with side constraints 82
The conditional value at risk with side constraints 82
Conditional value at risk and related linear programming models for portfolio optimization 81
The dynamic traveling purchaser problem 80
Securitization of Financial Assets: Approximation in Theory and Practice 79
The Split Delivery Vehicle Routing Problem with Small Capacity 78
Core Search: An application to portfolio optimisation 76
Enhanced index tracking with CVaR-based ratio measures 76
The Vehicle Routing Problem with Double and Triple Capacity, General Distances and Multiple Customer Visits 73
The Distance-Constrained Vehicle Purchaser Problem 72
Selezione di Portafoglio con Costi di Transazione 69
An effective tabu search algorithm for the capacitated travelling purchaser problem 69
Multi-visit Clustered Team Orienteering Problem 68
A column generation approach for the Multi-Vehicle Travelling Purchaser Problem with Pairwise Incompatibility Constraints 67
An exact algorithm for the Multidimensional Multiple-Choice Knapsack Problem 67
A Multidimensional Knapsack Model for the Selection of Contracts in an Asset-Backed Securitization 66
An effective hybrid heuristic for the Capacitated Total Quantity Discount Problem 66
A branch-and-price algorithm for the Multi-Vehicle Travelling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands 66
The Multi-Vehicle Traveling Purchaser Problem with Exclusionary Side Constraints 65
Multi-Vehicle Traveling Purchaser Problem with Exclusionary Side Constraints 64
Exact algorithm for the Total Quantity Discount Problem 64
Vendor selection: optimizing procurement and shipping costs 63
A New Exact Algorithm for the Multidimensional Multiple-Choice Knapsack Problem 63
Totale 10.469
Salva come PNG Salva come JPEG
Categoria #
all - tutte 58.601
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 58.601
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.359 0 0 0 0 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/2025714 28 34 62 288 302 0 0 0 0 0 0 0
Totale 12.672