IRIS Institutional Research Information System - OPENBS Open Archive UniBS

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019565 0 0 0 0 0 0 0 0 0 0 286 279
2019/20203.357 446 78 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/2024818 67 31 60 107 41 98 75 40 270 28 1 0
Totale 11.672