PORTO @ Archivio Istituzionale della Ricerca

SALASSA, FABIO GUIDO MARIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 5.162
NA - Nord America 4.366
AS - Asia 939
AF - Africa 44
SA - Sud America 32
OC - Oceania 16
Totale 10.559
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.276
IT - Italia 1.678
DE - Germania 912
FR - Francia 720
GB - Regno Unito 708
CN - Cina 413
UA - Ucraina 270
SE - Svezia 160
SG - Singapore 150
IE - Irlanda 117
TR - Turchia 116
RU - Federazione Russa 90
CA - Canada 87
NL - Olanda 73
KR - Corea 72
CH - Svizzera 71
BE - Belgio 65
AT - Austria 60
FI - Finlandia 60
PT - Portogallo 34
MY - Malesia 32
SN - Senegal 32
JP - Giappone 27
IN - India 26
LU - Lussemburgo 24
HK - Hong Kong 23
BR - Brasile 22
JO - Giordania 21
EU - Europa 17
AP - ???statistics.table.value.countryCode.AP??? 16
BG - Bulgaria 16
IL - Israele 15
CZ - Repubblica Ceca 14
ES - Italia 14
AU - Australia 13
PL - Polonia 12
IR - Iran 11
AE - Emirati Arabi Uniti 7
RO - Romania 7
TW - Taiwan 7
TH - Thailandia 6
CL - Cile 5
EE - Estonia 5
DK - Danimarca 4
AR - Argentina 3
EG - Egitto 3
HU - Ungheria 3
LV - Lettonia 3
MX - Messico 3
TN - Tunisia 3
UZ - Uzbekistan 3
GR - Grecia 2
HR - Croazia 2
ID - Indonesia 2
KZ - Kazakistan 2
NZ - Nuova Zelanda 2
SA - Arabia Saudita 2
SC - Seychelles 2
AL - Albania 1
AM - Armenia 1
AZ - Azerbaigian 1
BY - Bielorussia 1
CI - Costa d'Avorio 1
CM - Camerun 1
FJ - Figi 1
GH - Ghana 1
LB - Libano 1
MA - Marocco 1
MD - Moldavia 1
MO - Macao, regione amministrativa speciale della Cina 1
NO - Norvegia 1
PE - Perù 1
PK - Pakistan 1
VE - Venezuela 1
Totale 10.559
Salva come PNG Salva come JPEG
Città #
Ashburn 1.077
Southend 631
Seattle 545
Turin 414
Chandler 351
Fairfield 241
Torino 220
Princeton 174
Ann Arbor 154
Beijing 152
Woodbridge 135
Jacksonville 129
Houston 126
Cambridge 115
Boardman 103
Singapore 103
Dublin 102
Berlin 97
Izmir 90
Wilmington 88
San Ramon 83
Bern 62
Milan 61
Trofarello 61
Ottawa 54
Brussels 50
Vienna 47
Chicago 46
Helsinki 45
San Donato Milanese 44
Mountain View 42
Saint Petersburg 39
Zaporozhye 39
Bologna 38
Baltimore 32
Council Bluffs 32
Guangzhou 32
Tours 30
Rome 28
Pennsylvania Furnace 27
Redwood City 26
Bremen 24
Dearborn 24
Shanghai 22
Grafing 20
Toronto 20
Alessandria 19
Frankfurt 18
Monopoli 18
Overberg 17
Washington 17
Atlanta 16
Nanning 16
Naples 16
Paris 16
Pianezza 16
Zhengzhou 16
Des Moines 15
Porto 15
Santa Clara 15
Sofia 15
Hangzhou 14
New York 13
Seoul 13
Shenzhen 13
Lecce 12
Nottingham 12
Padua 12
Amsterdam 11
Anadia 11
Lappeenranta 11
Fremont 10
Malatya 10
Palermo 10
Augsburg 9
Falls Church 9
Holon 9
London 9
Norwalk 9
Prague 9
Andover 8
San Diego 8
Herkenbosch 7
Jinan 7
Melbourne 7
Melun 7
Moscow 7
Catania 6
Frankfurt am Main 6
Fuzhou 6
Genova 6
Grugliasco 6
Montréal 6
Selargius 6
Wuhan 6
Boydton 5
Changsha 5
Hong Kong 5
Istanbul 5
Livorno 5
Totale 6.650
Salva come PNG Salva come JPEG
Nome #
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 560
An exact approach for the 0–1 knapsack problem with setups 363
A Variable Neighborhood Search Based Matheuristic for Nurse Rostering Problems 358
A Matheuristic Approach For The Two-Machine Total Completion Time Flow Shop Problem 336
An Automatic Tool Supporting Life-long Learning Based on a Semantic-Oriented Approach for Comparing Qualifications 326
Matheuristics for combinatorial optimization problems: applications to services and production systems 322
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem 319
A Distributed IoT Infrastructure to Test and Deploy Real-Time Demand Response in Smart Grids 305
A system to integrate unstructured and semistructured information resources: an application in an innovation design process 292
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 284
Matheuristics for Combinatorial Optimization Problems:Applications to Services and Production Systems 280
Improved LP-based algorithms for the closest string problem 279
A Matheuristic Approach for the Total Completion Time Permutation Flow Shop Problem 271
An integrated system to acquire knowledge and support decisions in complex innovation design processes 265
A variable neighborhood search based matheuristic for nurse rostering problems 261
A new exact approach for the 0–1 Collapsing Knapsack Problem 261
Case studies of Matheuristics applications to combinatorial optimization problems 253
Relazione Progetto "Supporto all’innovazione dei Flussi OspedalieriSIFO". Giugno 2010 248
Local and global constraint consistency in personnel rostering 245
A hybrid three-phase approach for the Max-Mean Dispersion Problem 243
An effective approach for the Knapsack problem with setup 241
Personnel Rostering Management by ICT Techniques 241
A hybrid heuristic approach for single machine scheduling with release times 235
A Unified Exact Approach for Knapsack Problems with Side Constraints 234
Heuristic approaches for a domestic energy management system 234
Integrating utilisation and productivity information in operating rooms 233
The one-dimensional cutting stock problem with sequence-dependent cut losses 231
Searching for a cycle with maximum coverage in undirected graphs 224
An exact semidefinite programming approach for the max-mean dispersion problem 223
A DSS to support the design of complex systems 215
Structuring fragmented knowledge: a case study 195
A system to analyse interviews and structure the acquired knowledge elements 186
Process Modelling and Knowledge Transfer in Healthcare 184
A system to analyse interviews and structure the acquired knowledge elements 183
A computational study of a cutting stock problem with sequence dependent cut losses 177
An ILP model and a hybrid heuristic for an energy management problem 174
A hybrid heuristic and bounding methods for the Max-Mean Dispersion Problem 163
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths 105
Merging Combinatorial Design and Optimization: the Oberwolfach Problem 95
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem 90
Column generation for minimizing total completion time in a parallel-batching environment 87
A simple and effective algorithm for the maximum happy vertices problem 77
Permutation flowshop problems minimizing core waiting time and core idle time 76
Heuristic Solution Methods for the Selective Disassembly Sequencing Problem under Sequence-Dependent Costs 73
Column generation for minimizing total completion time on a single machine with parallel batching 70
Exact solution of the two-machine flow shop problem with three operations 64
Single machine rescheduling for new orders with maximum lateness minimization 54
A Matheuristic Approach to the Open Shop Scheduling Problem with Sequence-Dependent Setup Times 49
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem 47
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs 41
Evaluating the Deployment of Collaborative Logistics Models for Local Delivery Services 41
The discrete time break scheduling problem under fatigue and no preemption: solution methods and impact of work regulations 30
Optimised break scheduling vs. rest breaks in collective agreements under fatigue and non preemption 12
Totale 10.655
Salva come PNG Salva come JPEG
Categoria #
all - tutte 26.592
article - articoli 12.706
book - libri 0
conference - conferenze 11.487
curatela - curatele 0
other - altro 666
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.133
Totale 52.584
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020830 0 0 0 108 101 161 89 129 112 50 35 45
2020/2021699 98 105 16 72 45 78 50 52 30 74 57 22
2021/2022946 32 38 22 43 78 53 26 31 99 77 174 273
2022/20231.111 119 186 76 91 105 148 94 61 100 18 40 73
2023/2024363 23 32 18 19 35 45 15 28 19 35 39 55
2024/2025314 17 204 74 19 0 0 0 0 0 0 0 0
Totale 10.655