PORTO @ Archivio Istituzionale della Ricerca

DELLA CROCE DI DOJOLA, Federico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 14.372
EU - Europa 14.271
AS - Asia 6.032
SA - Sud America 464
AF - Africa 91
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 4
Totale 35.247
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 14.250
CN - Cina 3.533
IT - Italia 3.052
GB - Regno Unito 2.578
DE - Germania 2.574
FR - Francia 2.451
SG - Singapore 1.158
UA - Ucraina 1.008
RU - Federazione Russa 475
KR - Corea 444
SE - Svezia 417
BR - Brasile 392
TR - Turchia 348
NL - Olanda 327
LU - Lussemburgo 304
IE - Irlanda 284
CH - Svizzera 206
FI - Finlandia 168
AT - Austria 135
CA - Canada 105
VN - Vietnam 72
HK - Hong Kong 69
BE - Belgio 67
JP - Giappone 60
JO - Giordania 59
MY - Malesia 52
IN - India 43
SN - Senegal 37
ES - Italia 33
IL - Israele 30
AP - ???statistics.table.value.countryCode.AP??? 28
IR - Iran 26
RO - Romania 26
TW - Taiwan 23
AR - Argentina 22
CZ - Repubblica Ceca 22
PL - Polonia 22
EU - Europa 21
IQ - Iraq 18
BG - Bulgaria 17
CL - Cile 16
ID - Indonesia 16
EC - Ecuador 15
PT - Portogallo 13
MX - Messico 11
UZ - Uzbekistan 11
AU - Australia 10
BD - Bangladesh 10
SA - Arabia Saudita 10
AE - Emirati Arabi Uniti 9
EG - Egitto 9
MA - Marocco 8
PK - Pakistan 8
TH - Thailandia 8
TN - Tunisia 7
ZA - Sudafrica 7
EE - Estonia 6
BY - Bielorussia 5
DK - Danimarca 5
DZ - Algeria 5
KE - Kenya 5
NO - Norvegia 5
PY - Paraguay 5
CO - Colombia 4
GR - Grecia 4
HU - Ungheria 4
KZ - Kazakistan 4
LV - Lettonia 4
SY - Repubblica araba siriana 4
UY - Uruguay 4
CI - Costa d'Avorio 3
GE - Georgia 3
NP - Nepal 3
NZ - Nuova Zelanda 3
PS - Palestinian Territory 3
VE - Venezuela 3
AL - Albania 2
AZ - Azerbaigian 2
DO - Repubblica Dominicana 2
GH - Ghana 2
HR - Croazia 2
LB - Libano 2
LK - Sri Lanka 2
NG - Nigeria 2
PE - Perù 2
PH - Filippine 2
SC - Seychelles 2
TJ - Tagikistan 2
ZW - Zimbabwe 2
AM - Armenia 1
AO - Angola 1
BA - Bosnia-Erzegovina 1
BB - Barbados 1
BO - Bolivia 1
CR - Costa Rica 1
HN - Honduras 1
JM - Giamaica 1
KG - Kirghizistan 1
MN - Mongolia 1
MO - Macao, regione amministrativa speciale della Cina 1
Totale 35.243
Salva come PNG Salva come JPEG
Città #
Ashburn 3.627
Beijing 2.652
Southend 2.318
Seattle 1.711
Fairfield 1.023
Chandler 720
Turin 650
Singapore 555
Houston 551
Woodbridge 541
Jacksonville 511
Princeton 505
Dallas 465
Cambridge 450
Ann Arbor 362
San Ramon 347
Wilmington 334
Berlin 297
Torino 289
Boardman 280
Dublin 266
Izmir 266
Santa Clara 233
Milan 222
Bern 193
Chicago 173
Frankfurt 161
Saint Petersburg 149
Helsinki 145
San Donato Milanese 141
Seoul 136
Zaporozhye 128
Shanghai 126
Baltimore 119
Pennsylvania Furnace 107
Vienna 107
Overberg 94
Mountain View 92
Zhengzhou 87
Council Bluffs 82
Herkenbosch 75
Amsterdam 65
Los Angeles 63
New York 57
Brussels 52
Redwood City 49
Hangzhou 48
Bremen 45
Buffalo 45
Toronto 45
Trofarello 45
Monopoli 44
San Diego 43
Naples 42
Washington 42
Bologna 41
Fremont 41
Rome 41
Hefei 40
Paris 40
Munich 38
Ottawa 38
Padua 38
Guangzhou 35
Hong Kong 35
São Paulo 35
Tours 33
Atlanta 31
Ho Chi Minh City 31
Istanbul 31
Alessandria 29
Norwalk 29
Moscow 28
Columbus 27
Frankfurt am Main 26
London 24
Melun 24
Malatya 23
Tongling 23
The Dalles 22
Andover 21
Dearborn 20
Lecce 20
Modena 20
Madrid 19
Noicattaro 19
Hanoi 17
Verona 17
Yubileyny 17
Rio de Janeiro 16
Sofia 16
Galati 15
Prague 15
Shenzhen 15
Tehran 14
Jinan 13
Kiev 13
Nottingham 13
Palermo 13
Tokyo 13
Totale 23.104
Salva come PNG Salva come JPEG
Nome #
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 583
Exact algorithms for dominating clique problems 512
Scheduling the Italian Football League: an ILP-based approach 468
The Red–Blue transportation problem 442
An exact approach for the 0–1 knapsack problem with setups 414
A greedy-based neighborhood search approach to a nurse rostering problem 401
Some thoughts on combinatorial optimisation 387
A heuristic algorithm for the Auto-Carrier transportation problem 384
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem 381
Iterated Inside Out: A New Exact Algorithm for the Transportation Problem 379
A genetic algorithm for the job shop problem 378
A Variable Neighborhood Search Based Matheuristic for Nurse Rostering Problems 372
The two-machine total completion time flow shop problem 363
A Matheuristic Approach For The Two-Machine Total Completion Time Flow Shop Problem 351
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem 344
Solving the hub location problem in telecommunication network design: a local search approach 341
A heuristic procedure for Rack Configuration in the Space Vehicle Accommodation problem 338
Discrete-Time, Economic Lot Scheduling Problem on Multiple, Non-Identical Production Lines 331
Minimizing Tardy jobs in a Flowshop with common due date 330
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 320
Elementi di Ricerca Operativa 312
A genetic algorithm for the crew rostering problem 311
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem 307
Scheduling a round robin tennis tournament under courts and players availability constraints 306
Improved LP-based algorithms for the closest string problem 300
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 300
On the max min vertex cover Problem 298
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 297
ON THE IMPACT OF THE SOLUTION REPRESENTATION FOR THE INTERNET PROTOCOL NETWORK DESIGN PROBLEM WITH MAX-HOP CONSTRAINTS 296
A terascale, cost-effective open solution for academic computing: early experience of the DAUIN HPC initiative 291
A Matheuristic Approach for the Total Completion Time Permutation Flow Shop Problem 287
A new exact approach for the 0–1 Collapsing Knapsack Problem 286
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances 281
Method and system for network topology updating using topology perturbation 280
A variable neighborhood search based matheuristic for nurse rostering problems 277
A note on MINIMIZING A QUADRATIC FUNCTION OF JOB LATENESS ON A SINGLE MACHINE 275
Device and Method for Optimising the Movement of Automated-Guided-Vehicles, and the like. 275
Improving an exact approach for solving separable integer quadratic knapsack problems 275
Case studies of Matheuristics applications to combinatorial optimization problems 275
A continuous knapsack problem formulation for the robustness analysis of a polytope of polynomials 274
A method for determining the minimum cost installation for apparatuses of a fixed telecommunication network 274
A "maximum node clustering" problem 272
A heuristic algorithm for the Auto-Carrier Transportation Problem 269
Sudoku per l'estate 267
A heuristic algorithm for the Auto-Carrier Transportation Problem 266
A hybrid three-phase approach for the Max-Mean Dispersion Problem 265
A Unified Exact Approach for Knapsack Problems with Side Constraints 263
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial , Mcmillan, London, 1999, 183-198. 262
Ricerca Operativa e Ottimizzazione 259
A multi-KP modeling for the Maximum Clique Problem 258
Personnel Rostering Management by ICT Techniques 258
Aggregate planning and scheduling in food industry: a case study 257
Solving the hub location problem in telecommunication network design: a local search approach 256
A heuristic approach for the Max-Min Diversity Problem based on Max Clique 256
An effective approach for the Knapsack problem with setup 255
Heuristic approaches for a domestic energy management system 254
Improving the preemptive bound for the single machine dynamic maximum lateness problem 254
Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints 251
Approximation algorithms for the 2-Peripatetic Salesman Problem with edge weights 1 and 2 251
A hybrid heuristic approach for single machine scheduling with release times 251
Finding the Pareto optima for the total and maximum tardiness single machine scheduling problem 251
Generalized Pairwise Interchanges and Machine Scheduling 250
A note on ‘‘Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time” 250
The Selective Fixing Algorithm for the closest string problem 246
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial needs 245
Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness problem. 243
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 243
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 242
Fondamenti di Ottimizzazione 242
An exact semidefinite programming approach for the max-mean dispersion problem 240
Algorithmic paradoxes of the Single Machine Total Tardiness Problem 240
Mixed Integer Linear Programming Models for CombinatorialOptimization Problems 238
A new decomposition approach for the single machine total tardiness problem 236
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria 235
Solving the Concentrator Location problem in two-level telecommunication network design: a local search approach 234
A hybrid polynomial heuristic framework for combinatorial optimization problems 233
Solution of the single machine total tardiness problem 233
Cellular Control of Manufacturing Systems 233
Minimizing Makespan in the two-machine flow shop with release times 232
An Improved Branch and Bound Algorithm for the two-machine Total Completion Time Flow Shop Problem 232
A note on ‘‘Two-machine flow-shop scheduling with rejection’’ and its link with flow-shop scheduling and common due date assignment 230
A note on minimizing the sum of quadratic completion times on twoidentical parallel machines 229
Revisiting branch and bound search strategies for machine scheduling problems 229
Improved worst-case complexity for the MIN 3-SET COVERING problem 227
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems 225
Solving a real world project scheduling problem with a genetic approach 225
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem 225
Simplex Algorithms for Linear Programming 224
Minimizing the weighted sum of quadratic completion times on a single machine 222
A hybrid polynomial heuristic framework for combinatorial optimization problems 221
Exact Algorithms for the 0-1 Penalized Knapsack Problem 221
Advanced Search Techniques for the Job Shop Problem: A Comparison 220
Modélisation de problèmes d'optimisation combinatoire à l'aide de la programmation linéaire mixte entière 219
An exact algorithm for MAX-CUT in sparse graphs 218
On the max min vertex cover problem 217
Worst-case Complexity of Exact Algorithms for NP-hard Problems 216
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem 216
Algorithms for dominating clique problems 216
A heuristic procedure for the Space Cargo Rack Configuration Problem 215
The Longest Processing Time rule for identical parallel machines revisited 213
Totale 28.046
Salva come PNG Salva come JPEG
Categoria #
all - tutte 95.842
article - articoli 61.833
book - libri 3.437
conference - conferenze 22.498
curatela - curatele 0
other - altro 0
patent - brevetti 1.994
selected - selezionate 0
volume - volumi 6.080
Totale 191.684
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.585 0 0 0 269 101 322 180 178 98 191 179 67
2021/20221.806 97 94 34 26 112 95 73 48 161 212 358 496
2022/20232.492 270 447 72 197 270 370 151 126 270 24 89 206
2023/2024682 56 56 31 34 91 62 30 51 25 42 73 131
2024/20252.648 36 415 175 231 221 123 91 161 496 196 202 301
2025/20261.720 383 384 905 48 0 0 0 0 0 0 0 0
Totale 35.391