PORTO @ Archivio Istituzionale della Ricerca

DELLA CROCE DI DOJOLA, Federico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 15.813
EU - Europa 15.228
AS - Asia 9.724
SA - Sud America 694
AF - Africa 127
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 4
Totale 41.603
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 15.649
CN - Cina 3.735
IT - Italia 3.266
DE - Germania 2.612
FR - Francia 2.602
GB - Regno Unito 2.596
SG - Singapore 2.257
VN - Vietnam 1.670
UA - Ucraina 1.016
RU - Federazione Russa 890
KR - Corea 557
BR - Brasile 553
SE - Svezia 420
NL - Olanda 373
TR - Turchia 367
LU - Lussemburgo 304
IE - Irlanda 285
CH - Svizzera 214
IN - India 208
HK - Hong Kong 204
FI - Finlandia 192
AT - Austria 136
CA - Canada 122
JP - Giappone 88
JO - Giordania 78
BE - Belgio 67
TH - Thailandia 62
PH - Filippine 61
BD - Bangladesh 60
MY - Malesia 57
TW - Taiwan 55
IQ - Iraq 52
AR - Argentina 48
ES - Italia 43
SN - Senegal 38
IL - Israele 34
EC - Ecuador 32
ID - Indonesia 30
AP - ???statistics.table.value.countryCode.AP??? 28
RO - Romania 27
CL - Cile 26
IR - Iran 26
SA - Arabia Saudita 26
PK - Pakistan 25
CZ - Repubblica Ceca 24
MX - Messico 24
PL - Polonia 24
EU - Europa 21
BG - Bulgaria 18
MA - Marocco 14
UZ - Uzbekistan 14
ZA - Sudafrica 14
AE - Emirati Arabi Uniti 13
EG - Egitto 13
PT - Portogallo 13
TN - Tunisia 11
AU - Australia 10
CO - Colombia 9
KE - Kenya 9
VE - Venezuela 8
BY - Bielorussia 7
EE - Estonia 7
PY - Paraguay 7
DZ - Algeria 6
GR - Grecia 6
LB - Libano 6
SY - Repubblica araba siriana 6
AL - Albania 5
DK - Danimarca 5
HU - Ungheria 5
KZ - Kazakistan 5
LV - Lettonia 5
NO - Norvegia 5
UY - Uruguay 5
CI - Costa d'Avorio 4
CR - Costa Rica 4
GE - Georgia 4
JM - Giamaica 4
PE - Perù 4
PS - Palestinian Territory 4
DO - Repubblica Dominicana 3
MM - Myanmar 3
NG - Nigeria 3
NP - Nepal 3
NZ - Nuova Zelanda 3
OM - Oman 3
AM - Armenia 2
AO - Angola 2
AZ - Azerbaigian 2
BB - Barbados 2
BO - Bolivia 2
GH - Ghana 2
HR - Croazia 2
KH - Cambogia 2
KW - Kuwait 2
LK - Sri Lanka 2
LT - Lituania 2
MN - Mongolia 2
NI - Nicaragua 2
RS - Serbia 2
Totale 41.580
Salva come PNG Salva come JPEG
Città #
Ashburn 3.798
Beijing 2.681
Southend 2.318
Seattle 1.712
Singapore 1.177
Fairfield 1.023
Turin 781
Chandler 720
San Jose 689
Houston 557
Woodbridge 541
Jacksonville 512
Princeton 505
Dallas 475
Cambridge 450
Ho Chi Minh City 425
Hanoi 373
Ann Arbor 362
San Ramon 347
Wilmington 334
Berlin 297
Torino 289
Boardman 285
Dublin 267
Izmir 266
Santa Clara 258
Milan 235
Seoul 206
Bern 193
Chicago 175
Helsinki 166
Frankfurt 161
Saint Petersburg 149
San Donato Milanese 141
Los Angeles 136
Hong Kong 129
Shanghai 128
Zaporozhye 128
Lauterbourg 127
Council Bluffs 120
Baltimore 119
Vienna 108
Pennsylvania Furnace 107
Overberg 94
Mountain View 92
Zhengzhou 88
Da Nang 78
Haiphong 76
Herkenbosch 75
New York 73
Amsterdam 69
Buffalo 58
São Paulo 53
Brussels 52
Moscow 52
Hangzhou 49
Redwood City 49
Toronto 48
Rome 46
Bremen 45
North Bergen 45
Paris 45
Trofarello 45
Bologna 44
Frankfurt am Main 44
Istanbul 44
Monopoli 44
Naples 44
San Diego 44
Hefei 43
Munich 43
Washington 43
Fremont 41
Guangzhou 41
Groningen 40
Ottawa 38
Padua 38
Atlanta 33
Tours 33
Alessandria 29
Norwalk 29
Bangkok 28
Columbus 27
London 26
The Dalles 26
Melun 24
Tokyo 24
Madrid 23
Malatya 23
Tongling 23
Baghdad 22
Biên Hòa 22
Hải Dương 22
Amman 21
Andover 21
Rio de Janeiro 21
Dearborn 20
Lecce 20
Modena 20
Noicattaro 19
Totale 26.349
Salva come PNG Salva come JPEG
Nome #
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 628
Exact algorithms for dominating clique problems 552
Scheduling the Italian Football League: an ILP-based approach 509
An exact approach for the 0–1 knapsack problem with setups 477
The Red–Blue transportation problem 472
A greedy-based neighborhood search approach to a nurse rostering problem 450
Iterated Inside Out: A New Exact Algorithm for the Transportation Problem 444
A heuristic algorithm for the Auto-Carrier transportation problem 422
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem 421
A genetic algorithm for the job shop problem 416
A Variable Neighborhood Search Based Matheuristic for Nurse Rostering Problems 414
Some thoughts on combinatorial optimisation 409
Solving the hub location problem in telecommunication network design: a local search approach 406
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem 396
A Matheuristic Approach For The Two-Machine Total Completion Time Flow Shop Problem 392
The two-machine total completion time flow shop problem 390
A heuristic procedure for Rack Configuration in the Space Vehicle Accommodation problem 379
Discrete-Time, Economic Lot Scheduling Problem on Multiple, Non-Identical Production Lines 375
Minimizing Tardy jobs in a Flowshop with common due date 361
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 360
Elementi di Ricerca Operativa 359
Scheduling a round robin tennis tournament under courts and players availability constraints 349
A terascale, cost-effective open solution for academic computing: early experience of the DAUIN HPC initiative 348
A genetic algorithm for the crew rostering problem 342
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem 340
ON THE IMPACT OF THE SOLUTION REPRESENTATION FOR THE INTERNET PROTOCOL NETWORK DESIGN PROBLEM WITH MAX-HOP CONSTRAINTS 336
A new exact approach for the 0–1 Collapsing Knapsack Problem 333
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 332
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 330
Device and Method for Optimising the Movement of Automated-Guided-Vehicles, and the like. 328
A Matheuristic Approach for the Total Completion Time Permutation Flow Shop Problem 324
On the max min vertex cover Problem 324
Improved LP-based algorithms for the closest string problem 319
A "maximum node clustering" problem 318
Case studies of Matheuristics applications to combinatorial optimization problems 318
A continuous knapsack problem formulation for the robustness analysis of a polytope of polynomials 316
Method and system for network topology updating using topology perturbation 314
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances 312
A Unified Exact Approach for Knapsack Problems with Side Constraints 312
A note on MINIMIZING A QUADRATIC FUNCTION OF JOB LATENESS ON A SINGLE MACHINE 310
A hybrid three-phase approach for the Max-Mean Dispersion Problem 308
An exact semidefinite programming approach for the max-mean dispersion problem 308
A method for determining the minimum cost installation for apparatuses of a fixed telecommunication network 307
Solving the hub location problem in telecommunication network design: a local search approach 304
Finding the Pareto optima for the total and maximum tardiness single machine scheduling problem 304
A variable neighborhood search based matheuristic for nurse rostering problems 303
The Longest Processing Time rule for identical parallel machines revisited 303
Sudoku per l'estate 299
Improving an exact approach for solving separable integer quadratic knapsack problems 296
A heuristic algorithm for the Auto-Carrier Transportation Problem 296
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial , Mcmillan, London, 1999, 183-198. 295
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 294
An effective approach for the Knapsack problem with setup 291
Heuristic approaches for a domestic energy management system 291
A heuristic algorithm for the Auto-Carrier Transportation Problem 291
A heuristic approach for the Max-Min Diversity Problem based on Max Clique 289
Ricerca Operativa e Ottimizzazione 287
Personnel Rostering Management by ICT Techniques 287
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial needs 285
The Selective Fixing Algorithm for the closest string problem 285
Generalized Pairwise Interchanges and Machine Scheduling 284
Fondamenti di Ottimizzazione 284
Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints 283
Improving the preemptive bound for the single machine dynamic maximum lateness problem 283
A hybrid heuristic approach for single machine scheduling with release times 282
A multi-KP modeling for the Maximum Clique Problem 281
Aggregate planning and scheduling in food industry: a case study 280
Approximation algorithms for the 2-Peripatetic Salesman Problem with edge weights 1 and 2 280
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems 280
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 279
A hybrid polynomial heuristic framework for combinatorial optimization problems 278
Mixed Integer Linear Programming Models for CombinatorialOptimization Problems 277
Algorithmic paradoxes of the Single Machine Total Tardiness Problem 274
Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness problem. 273
A note on ‘‘Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time” 273
Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions 273
Modélisation de problèmes d'optimisation combinatoire à l'aide de la programmation linéaire mixte entière 270
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria 267
Solving the Concentrator Location problem in two-level telecommunication network design: a local search approach 266
A note on ‘‘Two-machine flow-shop scheduling with rejection’’ and its link with flow-shop scheduling and common due date assignment 265
Cellular Control of Manufacturing Systems 264
Solution of the single machine total tardiness problem 263
"Minimizing the sum of quadratic completion times on twoidentical parallel machines" 262
A new decomposition approach for the single machine total tardiness problem 262
An exact algorithm for MAX-CUT in sparse graphs 262
Exact Algorithms for the 0-1 Penalized Knapsack Problem 261
Minimizing Makespan in the two-machine flow shop with release times 259
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem 259
A note on minimizing the sum of quadratic completion times on twoidentical parallel machines 258
Improved worst-case complexity for the MIN 3-SET COVERING problem 256
On the max min vertex cover problem 256
Solving a real world project scheduling problem with a genetic approach 256
Simplex Algorithms for Linear Programming 255
New exact approaches and approximation results for the Penalized Knapsack Problem 255
A branch-and-reduce exact algorithm for the single machine total tardiness problem 254
Revisiting branch and bound search strategies for machine scheduling problems 254
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem 253
Ricerca Operativa e Ottimizzazione 252
Advanced Search Techniques for the Job Shop Problem: A Comparison 252
Probabilisticgraph-coloring in bipartite and split graphs 252
Totale 31.837
Salva come PNG Salva come JPEG
Categoria #
all - tutte 109.699
article - articoli 71.075
book - libri 3.876
conference - conferenze 25.731
curatela - curatele 0
other - altro 0
patent - brevetti 2.237
selected - selezionate 0
volume - volumi 6.780
Totale 219.398
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202167 0 0 0 0 0 0 0 0 0 0 0 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/20268.083 383 384 905 680 411 544 1.008 603 1.903 1.002 203 57
Totale 41.754