MANSINI, Renata
 Distribuzione geografica
Continente #
NA - Nord America 6.879
EU - Europa 3.416
AS - Asia 2.494
SA - Sud America 30
AF - Africa 18
OC - Oceania 14
Continente sconosciuto - Info sul continente non disponibili 13
Totale 12.864
Nazione #
US - Stati Uniti d'America 6.851
CN - Cina 1.208
UA - Ucraina 843
DE - Germania 792
IT - Italia 664
SG - Singapore 505
HK - Hong Kong 432
RU - Federazione Russa 241
FI - Finlandia 205
TR - Turchia 188
IE - Irlanda 153
PL - Polonia 140
GB - Regno Unito 112
FR - Francia 61
IN - India 46
PT - Portogallo 39
SE - Svezia 30
BE - Belgio 25
CA - Canada 25
IR - Iran 25
NL - Olanda 21
DK - Danimarca 20
BR - Brasile 19
ES - Italia 17
JP - Giappone 16
VN - Vietnam 16
AU - Australia 14
EU - Europa 13
ID - Indonesia 12
AT - Austria 11
CZ - Repubblica Ceca 10
GR - Grecia 7
TW - Taiwan 7
CL - Cile 6
IL - Israele 5
NO - Norvegia 5
SA - Arabia Saudita 5
AR - Argentina 4
HU - Ungheria 4
ZA - Sudafrica 4
CH - Svizzera 3
KZ - Kazakistan 3
MA - Marocco 3
MU - Mauritius 3
MY - Malesia 3
PH - Filippine 3
RO - Romania 3
TH - Thailandia 3
AL - Albania 2
AM - Armenia 2
DZ - Algeria 2
KE - Kenya 2
KR - Corea 2
LK - Sri Lanka 2
MX - Messico 2
NG - Nigeria 2
SK - Slovacchia (Repubblica Slovacca) 2
AE - Emirati Arabi Uniti 1
AZ - Azerbaigian 1
CO - Colombia 1
CY - Cipro 1
EG - Egitto 1
GE - Georgia 1
IM - Isola di Man 1
IQ - Iraq 1
JO - Giordania 1
KG - Kirghizistan 1
LA - Repubblica Popolare Democratica del Laos 1
LT - Lituania 1
LU - Lussemburgo 1
LV - Lettonia 1
ME - Montenegro 1
OM - Oman 1
PA - Panama 1
RS - Serbia 1
TJ - Tagikistan 1
TN - Tunisia 1
UZ - Uzbekistan 1
Totale 12.864
Città #
Fairfield 956
Woodbridge 759
Jacksonville 619
Ann Arbor 586
Houston 572
Hong Kong 422
Ashburn 403
Singapore 403
Seattle 365
Wilmington 358
Cambridge 354
Chandler 327
Princeton 278
Nanjing 243
Brescia 233
Beijing 220
Dublin 149
Warsaw 138
Istanbul 137
Dearborn 106
Helsinki 104
New York 82
Nanchang 77
Jinan 73
Shenyang 71
Des Moines 65
Moscow 64
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 23
Los Angeles 22
San Francisco 21
Taizhou 21
Kocaeli 20
Haikou 19
Toronto 19
Kunming 18
Rome 17
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
Kırklareli 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
São Paulo 6
Taipei 6
Tokyo 6
Fuzhou 5
Magdeburg 5
Melbourne 5
Orzinuovi 5
Ospitaletto 5
Patras 5
Vienna 5
Würzburg 5
Zola Predosa 5
Aarhus 4
Adelsdorf 4
Bengaluru 4
Berlin 4
Budapest 4
Totale 9.287
Nome #
A Granular Variable Neighborhood Search Heuristic for the Tour Orienteering Problem with Time Windows 385
The stochastic and dynamic traveling purchaser problem 175
A Kernel Search for a Patient Satisfaction-oriented Nurse Routing Problem with Time-Windows 174
New rate adaptation method for JPEG2000-based SNR Scalable Video Coding with Integer Linear Programming models 170
Linear and mixed integer programming for portfolio optimization 162
The Traveling Purchaser Problem with time-dependent quantities 161
Kernel Search: A heuristic framework for MILP problems with binary variables 154
Attended Home Delivery: reducing last-mile environmental impact by changing customer habits 145
The Stochastic and Dynamic Traveling Purchaser Problem 142
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem 141
Comparison of policies in dynamic routing problems 138
Kernel Search: A new heuristic framework for portfolio selection 136
Mixed integer linear programming models for optimal crop selection 136
The Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands: A Branch-and-Price Approach 135
A Stochastic Programming Approach for the Traveling Purchaser Problem 134
The Capacitated Supplier Selection problem with Total Quantity Discount policy and Activation Costs under uncertainty 134
A real-time vehicle routing model for a courier service problem 131
The Traveling Purchaser Problem and its variants 130
Twenty years of linear programming based portfolio optimization 129
CORAL: An exact algorithm for the Multidimensional Knapsack Problem 128
Management policies in a dynamic multi-period routing problem 124
Modeling the pre-auction stage: the truckload case 124
Look-ahead heuristics for the dynamic traveling purchaser problem 123
The Distance Constrained Multiple Vehicle Traveling Purchaser Problem 123
A Branch-and-Cut Algorithm for the Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints 123
Short Term Strategies for a Dynamic Multi-period Routing Problem 119
Short Term Strategies for a Dynamic Multi-Period Routing Problem 119
The Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands: A Branch-and-Price Approach 119
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem 118
Comparison of policies in dynamic routing problems 117
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 115
An Effective Matheuristic for the Capacitated Total Quantity Discount Problem 115
Exploring greedy criteria for the dynamic traveling purchaser problem 113
Short Term Strategies for a Dynamic Multi-Period Routing Problem 112
A branch-and-bound algorithm for the time-Dependent rural postman problem 112
Optimizing the physician scheduling problem in a large hospital ward 112
A linear programming model for the separate refuse collection service 112
An exact algorithm for the Capacitated Total Quantity Discount Problem 111
An exact approach for portfolio selection with transaction costs and rounds 110
An Efficient Fully Polynomial Approximation Scheme for the Subset-Sum Problem 109
Models and simulations for portfolio rebalancing 109
The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery 109
Improving spare parts management for field services. A model and a case study for the repair kit problem 108
Kernel Search: A general heuristic for the Multi-dimensional Knapsack Problem 107
Semi-absolute deviation rule for mutual funds portfolio selection 106
The Hierarchical Mixed Rural Postman Problem 106
Heuristic Algorithms for the Portfolio Selection Problem with Minimum Transaction Lots 105
A Branch and Price Algorithm for a Simultaneous Pick-up and Delivery Problem 105
The Traveling Purchaser Problem with Budget Constraint 104
A comparison of Mad and CVaR with side constraints 103
Vehicle Purchaser Problem with Exclusionary Side Constraints 103
Exploring greedy criteria for the Dynamic Traveling Purchaser Problem 102
An efficient fully polynomial approximation scheme for the subset-sum problem 102
The Nurse Routing Problem with Workload Constraints and Incompatible Services 101
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm 99
Complexity and reducibility of the skip delivery problem 99
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search 98
Portfolio optimization and transaction costs 98
The supplier selection problem with quantity discounts and truckload shipping 98
Two Linear Approximation Algorithms for the Subset-Sum Problem 97
The generalized independent set problem: Polyhedral analysis and solution approaches 97
The multi-visit team orienteering problem with precedence constraints 97
On the effectiveness of scenario generation techniques in single-period portfolio optimization 97
LP solvable models for portfolio optimization: a classification and computational comparison 96
A model and solution algorithm for the Repair Kit Problem: An empirical application 96
A Multidimensional Knapsack Model for Asset-Backed Securitization 95
Optimizing the daily schedule of a wellness center 95
The directed profitable rural postman problem with incompatibility constraints 95
An Adaptive Large Neighborhood Search Approach for the Physician Scheduling Problem 94
Scheduling groups of tasks with precedence constraints on three dedicated processors 93
The Dynamic Traveling Purchaser Problem with Stochastic Quantities 91
On Selecting a Portfolio of Lease Contracts in an Asset-Backed Securitization Process 90
A branch-and-cut algorithm for the Team Orienteering Problem 90
Effective Algorithms for a Bounded Version of the Uncapacitated TPP 89
The Dynamic Travelling Purchaser Problem 88
New results for the Directed Profitable Rural Postman Problem 87
A comparison of MAD and CVaR with side constraints 86
The conditional value at risk with side constraints 85
Conditional value at risk and related linear programming models for portfolio optimization 84
The Dynamic Traveling Purchaser Problem 82
The Split Delivery Vehicle Routing Problem with Small Capacity 81
The dynamic traveling purchaser problem 81
Securitization of Financial Assets: Approximation in Theory and Practice 79
Core Search: An application to portfolio optimisation 79
Enhanced index tracking with CVaR-based ratio measures 77
The Distance-Constrained Vehicle Purchaser Problem 75
The Vehicle Routing Problem with Double and Triple Capacity, General Distances and Multiple Customer Visits 74
Selezione di Portafoglio con Costi di Transazione 72
Exact algorithm for the Total Quantity Discount Problem 71
An effective tabu search algorithm for the capacitated travelling purchaser problem 70
A column generation approach for the Multi-Vehicle Travelling Purchaser Problem with Pairwise Incompatibility Constraints 70
An exact algorithm for the Multidimensional Multiple-Choice Knapsack Problem 70
An effective hybrid heuristic for the Capacitated Total Quantity Discount Problem 69
A branch-and-price algorithm for the Multi-Vehicle Travelling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands 69
Multi-visit Clustered Team Orienteering Problem 69
A Multidimensional Knapsack Model for the Selection of Contracts in an Asset-Backed Securitization 67
The Multi-Vehicle Traveling Purchaser Problem with Exclusionary Side Constraints 66
A New Exact Algorithm for the Multidimensional Multiple-Choice Knapsack Problem 66
Multi-Vehicle Traveling Purchaser Problem with Exclusionary Side Constraints 65
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem 65
Totale 10.791
Categoria #
all - tutte 63.837
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 63.837


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.438 0 0 0 0 0 0 0 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/20251.342 28 34 62 288 375 225 225 105 0 0 0 0
Totale 13.300