PORTO @ Archivio Istituzionale della Ricerca

SALASSA, FABIO GUIDO MARIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 5.258
NA - Nord America 4.517
AS - Asia 1.134
SA - Sud America 68
AF - Africa 52
OC - Oceania 17
Totale 11.046
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.424
IT - Italia 1.694
DE - Germania 926
FR - Francia 724
GB - Regno Unito 715
CN - Cina 435
SG - Singapore 272
UA - Ucraina 270
SE - Svezia 160
RU - Federazione Russa 133
TR - Turchia 131
IE - Irlanda 117
CA - Canada 90
KR - Corea 86
NL - Olanda 73
CH - Svizzera 71
BE - Belgio 67
AT - Austria 63
FI - Finlandia 63
BR - Brasile 55
PT - Portogallo 34
SN - Senegal 33
MY - Malesia 32
JP - Giappone 27
HK - Hong Kong 26
IN - India 26
LU - Lussemburgo 24
JO - Giordania 21
IL - Israele 20
EU - Europa 17
AP - ???statistics.table.value.countryCode.AP??? 16
BG - Bulgaria 16
AU - Australia 14
CZ - Repubblica Ceca 14
ES - Italia 14
PL - Polonia 12
ID - Indonesia 11
IR - Iran 11
TW - Taiwan 8
AE - Emirati Arabi Uniti 7
RO - Romania 7
TH - Thailandia 6
AR - Argentina 5
CL - Cile 5
EE - Estonia 5
EG - Egitto 5
TN - Tunisia 5
DK - Danimarca 4
LT - Lituania 4
UZ - Uzbekistan 4
HU - Ungheria 3
LV - Lettonia 3
MX - Messico 3
GR - Grecia 2
HR - Croazia 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
EC - Ecuador 1
FJ - Figi 1
GH - Ghana 1
IQ - Iraq 1
KE - Kenya 1
LB - Libano 1
MA - Marocco 1
MD - Moldavia 1
MO - Macao, regione amministrativa speciale della Cina 1
NG - Nigeria 1
NO - Norvegia 1
PE - Perù 1
PK - Pakistan 1
PS - Palestinian Territory 1
SY - Repubblica araba siriana 1
VE - Venezuela 1
ZA - Sudafrica 1
Totale 11.046
Salva come PNG Salva come JPEG
Città #
Ashburn 1.081
Southend 631
Seattle 545
Turin 420
Chandler 351
Fairfield 241
Torino 220
Princeton 174
Ann Arbor 154
Beijing 152
Singapore 145
Woodbridge 135
Jacksonville 129
Houston 126
Santa Clara 122
Cambridge 115
Boardman 103
Dublin 102
Berlin 97
Izmir 90
Wilmington 88
San Ramon 83
Milan 68
Bern 62
Trofarello 61
Ottawa 55
Brussels 52
Helsinki 48
Vienna 48
Chicago 46
San Donato Milanese 44
Mountain View 42
Council Bluffs 40
Saint Petersburg 39
Zaporozhye 39
Bologna 38
Baltimore 32
Guangzhou 32
Rome 31
Tours 30
Pennsylvania Furnace 27
Redwood City 26
Bremen 24
Dearborn 24
Shanghai 24
Toronto 22
Grafing 20
Alessandria 19
Frankfurt 18
Monopoli 18
Overberg 17
Washington 17
Atlanta 16
Istanbul 16
Nanning 16
Naples 16
Paris 16
Pianezza 16
Zhengzhou 16
Des Moines 15
Porto 15
Sofia 15
Hangzhou 14
Frankfurt am Main 13
New York 13
Seoul 13
Shenzhen 13
Lecce 12
Nottingham 12
Padua 12
Amsterdam 11
Anadia 11
Lappeenranta 11
Fremont 10
London 10
Malatya 10
Palermo 10
Augsburg 9
Falls Church 9
Holon 9
Jakarta 9
Norwalk 9
Prague 9
Yubileyny 9
Andover 8
Hong Kong 8
Jinan 8
San Diego 8
Herkenbosch 7
Melbourne 7
Melun 7
Moscow 7
Nuremberg 7
Catania 6
Fuzhou 6
Genova 6
Grugliasco 6
Montréal 6
Selargius 6
Wuhan 6
Totale 6.871
Salva come PNG Salva come JPEG
Nome #
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 572
An exact approach for the 0–1 knapsack problem with setups 380
A Variable Neighborhood Search Based Matheuristic for Nurse Rostering Problems 362
An Automatic Tool Supporting Life-long Learning Based on a Semantic-Oriented Approach for Comparing Qualifications 345
A Matheuristic Approach For The Two-Machine Total Completion Time Flow Shop Problem 339
A Distributed IoT Infrastructure to Test and Deploy Real-Time Demand Response in Smart Grids 327
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem 326
Matheuristics for combinatorial optimization problems: applications to services and production systems 325
A system to integrate unstructured and semistructured information resources: an application in an innovation design process 301
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 290
Matheuristics for Combinatorial Optimization Problems:Applications to Services and Production Systems 288
Improved LP-based algorithms for the closest string problem 284
A Matheuristic Approach for the Total Completion Time Permutation Flow Shop Problem 275
An integrated system to acquire knowledge and support decisions in complex innovation design processes 272
A new exact approach for the 0–1 Collapsing Knapsack Problem 267
A variable neighborhood search based matheuristic for nurse rostering problems 265
Case studies of Matheuristics applications to combinatorial optimization problems 258
Relazione Progetto "Supporto all’innovazione dei Flussi OspedalieriSIFO". Giugno 2010 255
Local and global constraint consistency in personnel rostering 251
A hybrid three-phase approach for the Max-Mean Dispersion Problem 250
Integrating utilisation and productivity information in operating rooms 246
Personnel Rostering Management by ICT Techniques 245
The one-dimensional cutting stock problem with sequence-dependent cut losses 244
An effective approach for the Knapsack problem with setup 242
Heuristic approaches for a domestic energy management system 242
A Unified Exact Approach for Knapsack Problems with Side Constraints 240
A hybrid heuristic approach for single machine scheduling with release times 238
An exact semidefinite programming approach for the max-mean dispersion problem 230
Searching for a cycle with maximum coverage in undirected graphs 227
A DSS to support the design of complex systems 225
Structuring fragmented knowledge: a case study 202
Process Modelling and Knowledge Transfer in Healthcare 191
A computational study of a cutting stock problem with sequence dependent cut losses 190
A system to analyse interviews and structure the acquired knowledge elements 190
A system to analyse interviews and structure the acquired knowledge elements 189
An ILP model and a hybrid heuristic for an energy management problem 181
A hybrid heuristic and bounding methods for the Max-Mean Dispersion Problem 170
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths 114
Merging Combinatorial Design and Optimization: the Oberwolfach Problem 109
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem 99
Column generation for minimizing total completion time in a parallel-batching environment 98
Permutation flowshop problems minimizing core waiting time and core idle time 93
A simple and effective algorithm for the maximum happy vertices problem 89
Heuristic Solution Methods for the Selective Disassembly Sequencing Problem under Sequence-Dependent Costs 87
Column generation for minimizing total completion time on a single machine with parallel batching 81
Exact solution of the two-machine flow shop problem with three operations 81
Single machine rescheduling for new orders with maximum lateness minimization 64
A Matheuristic Approach to the Open Shop Scheduling Problem with Sequence-Dependent Setup Times 62
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem 56
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs 54
The discrete time break scheduling problem under fatigue and no preemption: solution methods and impact of work regulations 50
Evaluating the Deployment of Collaborative Logistics Models for Local Delivery Services 45
Optimised break scheduling vs. rest breaks in collective agreements under fatigue and non preemption 28
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server 20
Totale 11.154
Salva come PNG Salva come JPEG
Categoria #
all - tutte 29.141
article - articoli 14.204
book - libri 0
conference - conferenze 12.392
curatela - curatele 0
other - altro 703
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.200
Totale 57.640
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020242 0 0 0 0 0 0 0 0 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/2025813 17 204 74 133 121 68 65 72 59 0 0 0
Totale 11.154