PORTO @ Archivio Istituzionale della Ricerca

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20221.615 0 0 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.337 383 384 905 680 411 544 1.008 603 1.903 1.002 203 311
2026/2027662 278 258 126 0 0 0 0 0 0 0 0 0
Totale 42.670