PORTO @ Archivio Istituzionale della Ricerca

DELLA CROCE DI DOJOLA, Federico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 14.539
EU - Europa 14.325
AS - Asia 6.990
SA - Sud America 560
AF - Africa 103
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 4
Totale 36.534
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 14.414
CN - Cina 3.671
IT - Italia 3.069
DE - Germania 2.591
GB - Regno Unito 2.583
FR - Francia 2.452
SG - Singapore 1.858
UA - Ucraina 1.009
RU - Federazione Russa 475
BR - Brasile 459
KR - Corea 448
SE - Svezia 418
TR - Turchia 349
NL - Olanda 329
LU - Lussemburgo 304
IE - Irlanda 284
CH - Svizzera 208
FI - Finlandia 169
AT - Austria 135
VN - Vietnam 132
CA - Canada 107
HK - Hong Kong 85
BE - Belgio 67
JP - Giappone 66
JO - Giordania 60
MY - Malesia 54
IN - India 48
SN - Senegal 37
AR - Argentina 35
ES - Italia 34
IL - Israele 30
AP - ???statistics.table.value.countryCode.AP??? 28
IR - Iran 26
RO - Romania 26
EC - Ecuador 25
PL - Polonia 24
TW - Taiwan 23
CZ - Repubblica Ceca 22
ID - Indonesia 22
EU - Europa 21
IQ - Iraq 20
BG - Bulgaria 17
CL - Cile 17
PT - Portogallo 13
SA - Arabia Saudita 13
AE - Emirati Arabi Uniti 12
BD - Bangladesh 12
EG - Egitto 12
UZ - Uzbekistan 12
MX - Messico 11
PK - Pakistan 11
AU - Australia 10
ZA - Sudafrica 10
MA - Marocco 9
TN - Tunisia 9
TH - Thailandia 8
EE - Estonia 6
VE - Venezuela 6
BY - Bielorussia 5
CO - Colombia 5
DK - Danimarca 5
DZ - Algeria 5
KE - Kenya 5
KZ - Kazakistan 5
LV - Lettonia 5
NO - Norvegia 5
PY - Paraguay 5
SY - Repubblica araba siriana 5
AL - Albania 4
GE - Georgia 4
GR - Grecia 4
HU - Ungheria 4
UY - Uruguay 4
CI - Costa d'Avorio 3
DO - Repubblica Dominicana 3
NP - Nepal 3
NZ - Nuova Zelanda 3
PE - Perù 3
PS - Palestinian Territory 3
AZ - Azerbaigian 2
GH - Ghana 2
HR - Croazia 2
LB - Libano 2
LK - Sri Lanka 2
MN - Mongolia 2
NG - Nigeria 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
BJ - Benin 1
BO - Bolivia 1
CR - Costa Rica 1
HN - Honduras 1
JM - Giamaica 1
KG - Kirghizistan 1
Totale 36.525
Salva come PNG Salva come JPEG
Città #
Ashburn 3.670
Beijing 2.678
Southend 2.318
Seattle 1.711
Fairfield 1.023
Singapore 894
Chandler 720
Turin 653
Houston 552
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 240
Milan 226
Bern 193
Chicago 173
Frankfurt 161
Saint Petersburg 149
Helsinki 145
San Donato Milanese 141
Seoul 140
Zaporozhye 128
Shanghai 127
Baltimore 119
Pennsylvania Furnace 107
Vienna 107
Overberg 94
Mountain View 92
Zhengzhou 88
Council Bluffs 82
Los Angeles 78
Herkenbosch 75
Amsterdam 67
New York 60
Buffalo 56
Brussels 52
Hong Kong 51
Hangzhou 49
Redwood City 49
Ho Chi Minh City 46
Bremen 45
Toronto 45
Trofarello 45
Monopoli 44
San Diego 43
Naples 42
São Paulo 42
Washington 42
Bologna 41
Fremont 41
Guangzhou 41
Hefei 41
Rome 41
Paris 40
Munich 38
Ottawa 38
Padua 38
North Bergen 37
Frankfurt am Main 35
Atlanta 33
Tours 33
Istanbul 31
Alessandria 29
Hanoi 29
Norwalk 29
Moscow 28
Columbus 27
The Dalles 26
London 25
Melun 24
Malatya 23
Tongling 23
Andover 21
Dearborn 20
Lecce 20
Modena 20
Madrid 19
Noicattaro 19
Tokyo 19
Rio de Janeiro 18
Verona 17
Yubileyny 17
Sofia 16
Galati 15
Prague 15
Shenzhen 15
Tehran 14
Belo Horizonte 13
Jinan 13
Kiev 13
Totale 23.670
Salva come PNG Salva come JPEG
Nome #
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 592
Exact algorithms for dominating clique problems 517
Scheduling the Italian Football League: an ILP-based approach 476
The Red–Blue transportation problem 449
An exact approach for the 0–1 knapsack problem with setups 426
A greedy-based neighborhood search approach to a nurse rostering problem 412
Iterated Inside Out: A New Exact Algorithm for the Transportation Problem 392
A genetic algorithm for the job shop problem 391
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem 391
Some thoughts on combinatorial optimisation 390
A heuristic algorithm for the Auto-Carrier transportation problem 389
A Variable Neighborhood Search Based Matheuristic for Nurse Rostering Problems 381
The two-machine total completion time flow shop problem 375
A Matheuristic Approach For The Two-Machine Total Completion Time Flow Shop Problem 362
Solving the hub location problem in telecommunication network design: a local search approach 355
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem 354
A heuristic procedure for Rack Configuration in the Space Vehicle Accommodation problem 344
Discrete-Time, Economic Lot Scheduling Problem on Multiple, Non-Identical Production Lines 342
Minimizing Tardy jobs in a Flowshop with common due date 336
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 327
A genetic algorithm for the crew rostering problem 317
Elementi di Ricerca Operativa 316
Scheduling a round robin tennis tournament under courts and players availability constraints 315
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem 315
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 306
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 306
A terascale, cost-effective open solution for academic computing: early experience of the DAUIN HPC initiative 304
Improved LP-based algorithms for the closest string problem 304
On the max min vertex cover Problem 301
ON THE IMPACT OF THE SOLUTION REPRESENTATION FOR THE INTERNET PROTOCOL NETWORK DESIGN PROBLEM WITH MAX-HOP CONSTRAINTS 300
A new exact approach for the 0–1 Collapsing Knapsack Problem 298
A Matheuristic Approach for the Total Completion Time Permutation Flow Shop Problem 297
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances 289
Device and Method for Optimising the Movement of Automated-Guided-Vehicles, and the like. 287
Method and system for network topology updating using topology perturbation 286
Case studies of Matheuristics applications to combinatorial optimization problems 286
A note on MINIMIZING A QUADRATIC FUNCTION OF JOB LATENESS ON A SINGLE MACHINE 283
A variable neighborhood search based matheuristic for nurse rostering problems 283
A continuous knapsack problem formulation for the robustness analysis of a polytope of polynomials 282
A "maximum node clustering" problem 282
A method for determining the minimum cost installation for apparatuses of a fixed telecommunication network 280
A heuristic algorithm for the Auto-Carrier Transportation Problem 279
Improving an exact approach for solving separable integer quadratic knapsack problems 278
Sudoku per l'estate 275
A Unified Exact Approach for Knapsack Problems with Side Constraints 272
A hybrid three-phase approach for the Max-Mean Dispersion Problem 272
A heuristic algorithm for the Auto-Carrier Transportation Problem 271
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial , Mcmillan, London, 1999, 183-198. 268
Ricerca Operativa e Ottimizzazione 265
Solving the hub location problem in telecommunication network design: a local search approach 264
An effective approach for the Knapsack problem with setup 263
A heuristic approach for the Max-Min Diversity Problem based on Max Clique 263
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 263
Heuristic approaches for a domestic energy management system 263
Personnel Rostering Management by ICT Techniques 262
Improving the preemptive bound for the single machine dynamic maximum lateness problem 262
A multi-KP modeling for the Maximum Clique Problem 261
A hybrid heuristic approach for single machine scheduling with release times 261
Aggregate planning and scheduling in food industry: a case study 260
Fondamenti di Ottimizzazione 259
Approximation algorithms for the 2-Peripatetic Salesman Problem with edge weights 1 and 2 258
Finding the Pareto optima for the total and maximum tardiness single machine scheduling problem 258
Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints 256
Generalized Pairwise Interchanges and Machine Scheduling 256
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 255
A note on ‘‘Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time” 255
Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness problem. 253
The Selective Fixing Algorithm for the closest string problem 252
An exact semidefinite programming approach for the max-mean dispersion problem 250
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial needs 249
Mixed Integer Linear Programming Models for CombinatorialOptimization Problems 248
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems 245
Algorithmic paradoxes of the Single Machine Total Tardiness Problem 244
A new decomposition approach for the single machine total tardiness problem 242
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria 241
Solving the Concentrator Location problem in two-level telecommunication network design: a local search approach 240
Cellular Control of Manufacturing Systems 240
A hybrid polynomial heuristic framework for combinatorial optimization problems 237
A note on ‘‘Two-machine flow-shop scheduling with rejection’’ and its link with flow-shop scheduling and common due date assignment 237
An Improved Branch and Bound Algorithm for the two-machine Total Completion Time Flow Shop Problem 237
Solution of the single machine total tardiness problem 237
Minimizing Makespan in the two-machine flow shop with release times 235
A note on minimizing the sum of quadratic completion times on twoidentical parallel machines 235
Solving a real world project scheduling problem with a genetic approach 234
Improved worst-case complexity for the MIN 3-SET COVERING problem 233
Revisiting branch and bound search strategies for machine scheduling problems 233
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem 230
The Longest Processing Time rule for identical parallel machines revisited 229
Simplex Algorithms for Linear Programming 228
Exact Algorithms for the 0-1 Penalized Knapsack Problem 228
Advanced Search Techniques for the Job Shop Problem: A Comparison 227
Minimizing the weighted sum of quadratic completion times on a single machine 226
Modélisation de problèmes d'optimisation combinatoire à l'aide de la programmation linéaire mixte entière 226
An exact algorithm for MAX-CUT in sparse graphs 226
A hybrid polynomial heuristic framework for combinatorial optimization problems 225
On the max min vertex cover problem 225
A heuristic procedure for the Space Cargo Rack Configuration Problem 224
Algorithms for dominating clique problems 222
Worst-case Complexity of Exact Algorithms for NP-hard Problems 221
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem 221
Totale 28.817
Salva come PNG Salva come JPEG
Categoria #
all - tutte 99.704
article - articoli 64.391
book - libri 3.575
conference - conferenze 23.412
curatela - curatele 0
other - altro 0
patent - brevetti 2.061
selected - selezionate 0
volume - volumi 6.265
Totale 199.408
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.215 0 0 0 0 0 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/20263.007 383 384 905 680 411 244 0 0 0 0 0 0
Totale 36.678