PORTO @ Archivio Istituzionale della Ricerca

DELLA CROCE DI DOJOLA, Federico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 13.977
NA - Nord America 13.283
AS - Asia 4.276
AF - Africa 67
SA - Sud America 62
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 4
Totale 31.682
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 13.185
CN - Cina 3.035
IT - Italia 2.965
GB - Regno Unito 2.550
DE - Germania 2.513
FR - Francia 2.427
UA - Ucraina 1.004
RU - Federazione Russa 453
SE - Svezia 412
SG - Singapore 360
NL - Olanda 323
TR - Turchia 312
LU - Lussemburgo 304
IE - Irlanda 283
KR - Corea 224
CH - Svizzera 206
FI - Finlandia 150
AT - Austria 117
CA - Canada 94
BE - Belgio 63
JO - Giordania 56
MY - Malesia 52
JP - Giappone 49
SN - Senegal 36
BR - Brasile 34
HK - Hong Kong 33
ES - Italia 29
AP - ???statistics.table.value.countryCode.AP??? 28
IL - Israele 27
IN - India 26
IR - Iran 26
RO - Romania 26
CZ - Repubblica Ceca 21
EU - Europa 21
TW - Taiwan 20
BG - Bulgaria 17
CL - Cile 15
ID - Indonesia 14
PL - Polonia 14
PT - Portogallo 13
AU - Australia 10
AE - Emirati Arabi Uniti 8
VN - Vietnam 8
SA - Arabia Saudita 7
TH - Thailandia 7
EE - Estonia 6
TN - Tunisia 6
BY - Bielorussia 5
DK - Danimarca 5
DZ - Algeria 5
EG - Egitto 5
AR - Argentina 4
GR - Grecia 4
LV - Lettonia 4
NO - Norvegia 4
CI - Costa d'Avorio 3
EC - Ecuador 3
HU - Ungheria 3
KZ - Kazakistan 3
MX - Messico 3
NZ - Nuova Zelanda 3
SY - Repubblica araba siriana 3
CO - Colombia 2
GH - Ghana 2
LB - Libano 2
LK - Sri Lanka 2
NG - Nigeria 2
PH - Filippine 2
SC - Seychelles 2
UY - Uruguay 2
UZ - Uzbekistan 2
ZA - Sudafrica 2
ZW - Zimbabwe 2
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BD - Bangladesh 1
DO - Repubblica Dominicana 1
GE - Georgia 1
HR - Croazia 1
IQ - Iraq 1
MA - Marocco 1
MO - Macao, regione amministrativa speciale della Cina 1
PE - Perù 1
PK - Pakistan 1
RS - Serbia 1
SD - Sudan 1
VE - Venezuela 1
Totale 31.682
Salva come PNG Salva come JPEG
Città #
Ashburn 3.589
Beijing 2.562
Southend 2.318
Seattle 1.706
Fairfield 1.023
Chandler 720
Turin 620
Houston 550
Woodbridge 541
Jacksonville 511
Princeton 504
Cambridge 450
Ann Arbor 362
San Ramon 347
Wilmington 333
Berlin 297
Torino 289
Boardman 280
Dublin 266
Izmir 266
Singapore 251
Milan 205
Bern 193
Chicago 167
Frankfurt 161
Saint Petersburg 149
San Donato Milanese 141
Helsinki 139
Zaporozhye 128
Baltimore 117
Pennsylvania Furnace 107
Shanghai 107
Vienna 106
Overberg 94
Mountain View 92
Zhengzhou 85
Herkenbosch 75
Amsterdam 65
New York 51
Brussels 49
Redwood City 49
Council Bluffs 46
Hangzhou 46
Bremen 45
Trofarello 45
Monopoli 44
San Diego 43
Naples 42
Bologna 41
Fremont 41
Toronto 41
Washington 41
Paris 39
Padua 38
Ottawa 34
Santa Clara 33
Tours 33
Rome 30
Alessandria 29
Norwalk 29
Atlanta 27
Guangzhou 26
Moscow 26
Melun 24
Malatya 23
Andover 21
Dearborn 20
Lecce 20
Modena 20
London 19
Madrid 19
Noicattaro 19
Verona 17
Seoul 16
Sofia 16
Galati 15
Prague 14
Tehran 14
Kiev 13
Nottingham 13
Palermo 13
Shenzhen 13
Grafing 12
Hefei 12
Milano 12
Valfenera 12
Yubileyny 12
Catania 11
Augsburg 10
Charleston 10
Wuppertal 10
Collegno 9
Holon 9
Kwai Chung 9
Monza 9
Osaka 9
Podenzano 9
Putian 9
Redmond 9
Rotterdam 9
Totale 21.395
Salva come PNG Salva come JPEG
Nome #
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 562
Exact algorithms for dominating clique problems 489
Scheduling the Italian Football League: an ILP-based approach 444
The Red–Blue transportation problem 423
Some thoughts on combinatorial optimisation 375
An exact approach for the 0–1 knapsack problem with setups 367
A greedy-based neighborhood search approach to a nurse rostering problem 366
A heuristic algorithm for the Auto-Carrier transportation problem 363
A Variable Neighborhood Search Based Matheuristic for Nurse Rostering Problems 358
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem 340
A Matheuristic Approach For The Two-Machine Total Completion Time Flow Shop Problem 336
A genetic algorithm for the job shop problem 335
The two-machine total completion time flow shop problem 335
Solving the hub location problem in telecommunication network design: a local search approach 321
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem 320
A heuristic procedure for Rack Configuration in the Space Vehicle Accommodation problem 314
Minimizing Tardy jobs in a Flowshop with common due date 314
Discrete-Time, Economic Lot Scheduling Problem on Multiple, Non-Identical Production Lines 303
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 303
Elementi di Ricerca Operativa 299
A genetic algorithm for the crew rostering problem 292
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem 290
On the max min vertex cover Problem 289
ON THE IMPACT OF THE SOLUTION REPRESENTATION FOR THE INTERNET PROTOCOL NETWORK DESIGN PROBLEM WITH MAX-HOP CONSTRAINTS 284
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 284
Scheduling a round robin tennis tournament under courts and players availability constraints 283
Improved LP-based algorithms for the closest string problem 279
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 274
A Matheuristic Approach for the Total Completion Time Permutation Flow Shop Problem 273
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances 263
A new exact approach for the 0–1 Collapsing Knapsack Problem 262
A note on MINIMIZING A QUADRATIC FUNCTION OF JOB LATENESS ON A SINGLE MACHINE 261
Method and system for network topology updating using topology perturbation 261
A variable neighborhood search based matheuristic for nurse rostering problems 261
Improving an exact approach for solving separable integer quadratic knapsack problems 261
A terascale, cost-effective open solution for academic computing: early experience of the DAUIN HPC initiative 260
Device and Method for Optimising the Movement of Automated-Guided-Vehicles, and the like. 256
Case studies of Matheuristics applications to combinatorial optimization problems 253
A heuristic algorithm for the Auto-Carrier Transportation Problem 253
A "maximum node clustering" problem 251
A method for determining the minimum cost installation for apparatuses of a fixed telecommunication network 250
A heuristic algorithm for the Auto-Carrier Transportation Problem 249
A continuous knapsack problem formulation for the robustness analysis of a polytope of polynomials 248
A multi-KP modeling for the Maximum Clique Problem 245
Sudoku per l'estate 245
A hybrid three-phase approach for the Max-Mean Dispersion Problem 244
A note on ‘‘Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time” 244
Ricerca Operativa e Ottimizzazione 243
Personnel Rostering Management by ICT Techniques 243
Improving the preemptive bound for the single machine dynamic maximum lateness problem 243
A heuristic approach for the Max-Min Diversity Problem based on Max Clique 242
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial , Mcmillan, London, 1999, 183-198. 241
An effective approach for the Knapsack problem with setup 241
Aggregate planning and scheduling in food industry: a case study 238
Generalized Pairwise Interchanges and Machine Scheduling 236
A hybrid heuristic approach for single machine scheduling with release times 236
Heuristic approaches for a domestic energy management system 236
Approximation algorithms for the 2-Peripatetic Salesman Problem with edge weights 1 and 2 235
A Unified Exact Approach for Knapsack Problems with Side Constraints 235
Finding the Pareto optima for the total and maximum tardiness single machine scheduling problem 235
Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness problem. 234
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial needs 233
Solving the hub location problem in telecommunication network design: a local search approach 232
Algorithmic paradoxes of the Single Machine Total Tardiness Problem 230
Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints 229
A new decomposition approach for the single machine total tardiness problem 228
Mixed Integer Linear Programming Models for CombinatorialOptimization Problems 228
An exact semidefinite programming approach for the max-mean dispersion problem 224
Cellular Control of Manufacturing Systems 223
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria 222
The Selective Fixing Algorithm for the closest string problem 222
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 219
A note on ‘‘Two-machine flow-shop scheduling with rejection’’ and its link with flow-shop scheduling and common due date assignment 218
Revisiting branch and bound search strategies for machine scheduling problems 217
Fondamenti di Ottimizzazione 217
An Improved Branch and Bound Algorithm for the two-machine Total Completion Time Flow Shop Problem 216
Improved worst-case complexity for the MIN 3-SET COVERING problem 215
Minimizing Makespan in the two-machine flow shop with release times 215
A note on minimizing the sum of quadratic completion times on twoidentical parallel machines 214
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem 214
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 213
Solving the Concentrator Location problem in two-level telecommunication network design: a local search approach 213
A hybrid polynomial heuristic framework for combinatorial optimization problems 212
Simplex Algorithms for Linear Programming 212
Solving a real world project scheduling problem with a genetic approach 211
Minimizing the weighted sum of quadratic completion times on a single machine 208
An exact algorithm for MAX-CUT in sparse graphs 207
Advanced Search Techniques for the Job Shop Problem: A Comparison 206
A hybrid polynomial heuristic framework for combinatorial optimization problems 205
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem 204
Exact Algorithms for the 0-1 Penalized Knapsack Problem 204
Algorithms for dominating clique problems 203
Modélisation de problèmes d'optimisation combinatoire à l'aide de la programmation linéaire mixte entière 203
On the max min vertex cover problem 202
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems 202
A heuristic procedure for the Space Cargo Rack Configuration Problem 200
Worst-case Complexity of Exact Algorithms for NP-hard Problems 200
Computational experience with a core-based reduction procedure for the 2-knapsack problem 198
The economic lot scheduling problem: A recovering beam searchapproach 194
Probabilisticgraph-coloring in bipartite and split graphs 194
Totale 26.027
Salva come PNG Salva come JPEG
Categoria #
all - tutte 81.056
article - articoli 51.769
book - libri 2.984
conference - conferenze 19.250
curatela - curatele 0
other - altro 0
patent - brevetti 1.729
selected - selezionate 0
volume - volumi 5.324
Totale 162.112
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.630 0 0 0 439 390 397 243 447 358 194 96 66
2020/20212.325 332 305 103 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/2025788 36 415 175 162 0 0 0 0 0 0 0 0
Totale 31.811