PORTO @ Archivio Istituzionale della Ricerca

DELLA CROCE DI DOJOLA, Federico
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 14.021
NA - Nord America 13.364
AS - Asia 4.370
AF - Africa 67
SA - Sud America 62
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 4
Totale 31.901
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 13.259
CN - Cina 3.039
IT - Italia 2.977
GB - Regno Unito 2.555
DE - Germania 2.523
FR - Francia 2.427
UA - Ucraina 1.004
RU - Federazione Russa 465
SE - Svezia 412
SG - Singapore 402
TR - Turchia 339
NL - Olanda 323
LU - Lussemburgo 304
IE - Irlanda 283
KR - Corea 242
CH - Svizzera 206
FI - Finlandia 152
AT - Austria 117
CA - Canada 101
BE - Belgio 66
JO - Giordania 56
MY - Malesia 52
JP - Giappone 49
HK - Hong Kong 36
SN - Senegal 36
BR - Brasile 34
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.901
Salva come PNG Salva come JPEG
Città #
Ashburn 3.595
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
Singapore 290
Torino 289
Boardman 280
Dublin 266
Izmir 266
Milan 207
Bern 193
Chicago 167
Frankfurt 161
Saint Petersburg 149
Helsinki 141
San Donato Milanese 141
Zaporozhye 128
Baltimore 117
Shanghai 108
Pennsylvania Furnace 107
Vienna 106
Santa Clara 95
Overberg 94
Mountain View 92
Zhengzhou 85
Herkenbosch 75
Amsterdam 65
Brussels 52
New York 51
Redwood City 49
Council Bluffs 46
Hangzhou 46
Bremen 45
Toronto 45
Trofarello 45
Monopoli 44
San Diego 43
Naples 42
Bologna 41
Fremont 41
Washington 41
Paris 39
Padua 38
Ottawa 37
Rome 33
Tours 33
Alessandria 29
Norwalk 29
Istanbul 28
Atlanta 27
Guangzhou 26
Moscow 26
Melun 24
Malatya 23
Andover 21
Dearborn 20
Lecce 20
London 20
Modena 20
Madrid 19
Noicattaro 19
Frankfurt am Main 17
Verona 17
Yubileyny 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
Catania 11
Collegno 11
Augsburg 10
Charleston 10
Wuppertal 10
Holon 9
Kwai Chung 9
Monza 9
Osaka 9
Podenzano 9
Putian 9
Totale 21.555
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 490
Scheduling the Italian Football League: an ILP-based approach 445
The Red–Blue transportation problem 424
Some thoughts on combinatorial optimisation 375
A greedy-based neighborhood search approach to a nurse rostering problem 370
An exact approach for the 0–1 knapsack problem with setups 368
A heuristic algorithm for the Auto-Carrier transportation problem 363
A Variable Neighborhood Search Based Matheuristic for Nurse Rostering Problems 359
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem 342
The two-machine total completion time flow shop problem 339
A genetic algorithm for the job shop problem 338
A Matheuristic Approach For The Two-Machine Total Completion Time Flow Shop Problem 337
Solving the hub location problem in telecommunication network design: a local search approach 324
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem 322
A heuristic procedure for Rack Configuration in the Space Vehicle Accommodation problem 315
Minimizing Tardy jobs in a Flowshop with common due date 315
Discrete-Time, Economic Lot Scheduling Problem on Multiple, Non-Identical Production Lines 305
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 303
Elementi di Ricerca Operativa 301
A genetic algorithm for the crew rostering problem 293
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem 290
On the max min vertex cover Problem 289
Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems 288
ON THE IMPACT OF THE SOLUTION REPRESENTATION FOR THE INTERNET PROTOCOL NETWORK DESIGN PROBLEM WITH MAX-HOP CONSTRAINTS 284
Scheduling a round robin tennis tournament under courts and players availability constraints 283
Improved LP-based algorithms for the closest string problem 280
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem 277
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 265
Method and system for network topology updating using topology perturbation 263
A new exact approach for the 0–1 Collapsing Knapsack Problem 263
A terascale, cost-effective open solution for academic computing: early experience of the DAUIN HPC initiative 262
A variable neighborhood search based matheuristic for nurse rostering problems 262
A note on MINIMIZING A QUADRATIC FUNCTION OF JOB LATENESS ON A SINGLE MACHINE 261
Improving an exact approach for solving separable integer quadratic knapsack problems 261
Device and Method for Optimising the Movement of Automated-Guided-Vehicles, and the like. 257
Case studies of Matheuristics applications to combinatorial optimization problems 255
A heuristic algorithm for the Auto-Carrier Transportation Problem 255
A "maximum node clustering" problem 252
A method for determining the minimum cost installation for apparatuses of a fixed telecommunication network 251
A continuous knapsack problem formulation for the robustness analysis of a polytope of polynomials 250
A heuristic algorithm for the Auto-Carrier Transportation Problem 250
Ricerca Operativa e Ottimizzazione 247
Sudoku per l'estate 246
A multi-KP modeling for the Maximum Clique Problem 245
A hybrid three-phase approach for the Max-Mean Dispersion Problem 245
A note on ‘‘Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time” 244
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial , Mcmillan, London, 1999, 183-198. 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
An effective approach for the Knapsack problem with setup 241
Aggregate planning and scheduling in food industry: a case study 239
Generalized Pairwise Interchanges and Machine Scheduling 238
Heuristic approaches for a domestic energy management system 237
A hybrid heuristic approach for single machine scheduling with release times 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
Solving the hub location problem in telecommunication network design: a local search approach 233
A scheduling prototype for the factory automation: matching OR methodologies to the actual industrial needs 233
Algorithmic paradoxes of the Single Machine Total Tardiness Problem 232
Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints 230
A new decomposition approach for the single machine total tardiness problem 229
Mixed Integer Linear Programming Models for CombinatorialOptimization Problems 229
An exact semidefinite programming approach for the max-mean dispersion problem 226
Cellular Control of Manufacturing Systems 225
The Selective Fixing Algorithm for the closest string problem 225
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria 223
Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems 221
A note on ‘‘Two-machine flow-shop scheduling with rejection’’ and its link with flow-shop scheduling and common due date assignment 220
Fondamenti di Ottimizzazione 220
An Improved Branch and Bound Algorithm for the two-machine Total Completion Time Flow Shop Problem 218
Revisiting branch and bound search strategies for machine scheduling problems 218
Improved worst-case complexity for the MIN 3-SET COVERING problem 216
Minimizing Makespan in the two-machine flow shop with release times 216
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem 216
Solving the Concentrator Location problem in two-level telecommunication network design: a local search approach 215
A note on minimizing the sum of quadratic completion times on twoidentical parallel machines 215
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 214
A hybrid polynomial heuristic framework for combinatorial optimization problems 213
Simplex Algorithms for Linear Programming 213
Solving a real world project scheduling problem with a genetic approach 213
An exact algorithm for MAX-CUT in sparse graphs 210
Minimizing the weighted sum of quadratic completion times on a single machine 209
Advanced Search Techniques for the Job Shop Problem: A Comparison 207
A hybrid polynomial heuristic framework for combinatorial optimization problems 206
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem 205
Algorithms for dominating clique problems 205
Exact Algorithms for the 0-1 Penalized Knapsack Problem 205
On the max min vertex cover problem 204
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems 204
Modélisation de problèmes d'optimisation combinatoire à l'aide de la programmation linéaire mixte entière 203
A heuristic procedure for the Space Cargo Rack Configuration Problem 201
Worst-case Complexity of Exact Algorithms for NP-hard Problems 200
Computational experience with a core-based reduction procedure for the 2-knapsack problem 199
Probabilisticgraph-coloring in bipartite and split graphs 198
The economic lot scheduling problem: A recovering beam searchapproach 194
Totale 26.152
Salva come PNG Salva come JPEG
Categoria #
all - tutte 82.407
article - articoli 52.691
book - libri 3.039
conference - conferenze 19.538
curatela - curatele 0
other - altro 0
patent - brevetti 1.746
selected - selezionate 0
volume - volumi 5.393
Totale 164.814
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.191 0 0 0 0 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/20251.007 36 415 175 231 150 0 0 0 0 0 0 0
Totale 32.030