MARINELLI, Fabrizio
 Distribuzione geografica
Continente #
NA - Nord America 3.103
EU - Europa 2.263
AS - Asia 1.234
SA - Sud America 197
AF - Africa 47
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 4
Totale 6.856
Nazione #
US - Stati Uniti d'America 3.079
IT - Italia 531
SG - Singapore 383
UA - Ucraina 379
CN - Cina 338
RU - Federazione Russa 251
HK - Hong Kong 249
SE - Svezia 230
IE - Irlanda 227
DE - Germania 218
BR - Brasile 186
DK - Danimarca 135
TR - Turchia 119
FI - Finlandia 93
FR - Francia 74
KR - Corea 71
GB - Regno Unito 57
CI - Costa d'Avorio 30
BE - Belgio 23
IN - India 19
CA - Canada 17
JP - Giappone 14
AT - Austria 13
NL - Olanda 10
AE - Emirati Arabi Uniti 8
MA - Marocco 8
AU - Australia 7
PL - Polonia 7
BD - Bangladesh 5
ZA - Sudafrica 4
AZ - Azerbaigian 3
EU - Europa 3
OM - Oman 3
RO - Romania 3
VN - Vietnam 3
AR - Argentina 2
CZ - Repubblica Ceca 2
EC - Ecuador 2
ES - Italia 2
GR - Grecia 2
IR - Iran 2
JM - Giamaica 2
KE - Kenya 2
LB - Libano 2
MX - Messico 2
NP - Nepal 2
PE - Perù 2
PH - Filippine 2
PK - Pakistan 2
SA - Arabia Saudita 2
A2 - ???statistics.table.value.countryCode.A2??? 1
BO - Bolivia 1
CH - Svizzera 1
CL - Cile 1
CO - Colombia 1
CR - Costa Rica 1
DZ - Algeria 1
EE - Estonia 1
GE - Georgia 1
HN - Honduras 1
ID - Indonesia 1
IQ - Iraq 1
JO - Giordania 1
LT - Lituania 1
LV - Lettonia 1
MU - Mauritius 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
PS - Palestinian Territory 1
PT - Portogallo 1
PY - Paraguay 1
TM - Turkmenistan 1
TN - Tunisia 1
TT - Trinidad e Tobago 1
UZ - Uzbekistan 1
VE - Venezuela 1
Totale 6.856
Città #
Jacksonville 401
Chandler 388
Hong Kong 249
Boardman 233
Dublin 227
Singapore 209
Fairfield 186
Des Moines 185
Ashburn 147
Wilmington 124
Centro 118
Hefei 100
Ann Arbor 93
Lawrence 91
Princeton 91
Seattle 86
New York 83
San Mateo 82
Woodbridge 79
Houston 73
Cambridge 71
The Dalles 69
Moscow 53
Ancona 40
Beijing 39
Abidjan 30
Turin 26
Brussels 23
Rome 22
Wuhan 21
Los Angeles 20
Macerata 19
Milan 19
Munich 19
Helsinki 17
Guangzhou 16
Shanghai 16
San Diego 15
Pescara 13
São Paulo 13
Washington 11
London 10
Tokyo 10
Ascoli Piceno 9
Tolentino 9
Vienna 9
Falls Church 8
Florence 8
Norwalk 8
Turku 8
Augusta 7
San Francisco 7
Belo Horizonte 6
Bologna 6
Brooklyn 6
Campinas 6
Dallas 6
Jiaxing 6
Ottawa 6
Rio de Janeiro 6
Tavullia 6
Chicago 5
Fermo 5
Nuremberg 5
Pune 5
Redmond 5
Santa Clara 5
Shenzhen 5
Warsaw 5
Yiwu 5
Brasília 4
Chiaravalle 4
Clifton 4
Fayetteville 4
Frankfurt am Main 4
Irvine 4
Istanbul 4
Melbourne 4
Montesilvano Marina 4
Rende 4
Southwark 4
Ankara 3
Atlanta 3
Baku 3
Betim 3
Cardito 3
Caserta 3
Castelfidardo 3
Charlotte 3
Dortmund 3
Filottrano 3
Fossombrone 3
Ipatinga 3
L’Aquila 3
Macaé 3
Montelabbate 3
Montreal 3
Nanjing 3
Phoenix 3
Pisa 3
Totale 4.110
Nome #
An Optimization Framework for “Build-or-Buy” Decisions in Software Architecture 126
From Artificial Intelligence and Databases to Cognitive Computing: Past and Future Computer Engineering Research at UNIVPM 123
Minimum flow time graph ordering 113
Shelf space re-allocation for out of stock reduction 111
A Lagrangian Heuristic for Satellite Range Scheduling with Resource Constraints 108
A Graph-Based Analysis on the Growth and Migration of MDA-MB-231 Breast Cancer Cells 106
A Matheuristic for the Design and Management of Multi-energy Systems 105
An Optimization Model for Trim Loss Minimization in an Automotive Glass Plant 104
Riduzione degli Sfridi da Operazioni di Taglio: Modelli di Ottimizzazione e Applicazioni Industriali 100
An LP-based tabu search for batch scheduling in a cutting process with finite buffers 100
A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing 100
A lower bound for the cutting stock problem with a limited number of open stacks 94
A Model-Based Approach for the Long Term Planning of Distributed Energy Systems in the Energy Transition 94
Automated selection of software components based on cost/reliability tradeoff 93
Optimal production planning by reusing components 93
Double Variable Neighbourhood Search with Smoothing for the Molecular Distance Geometry Problem 92
The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization 90
Controlling open stacks and flow time in a cutting process 89
A Lagrangean-based heuristic for a multimission automatic scheduler 88
A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem 88
Modelli matematici per ridurre gli sfridi da operazioni di taglio e razionalizzare i formati nell’industria del vetro 86
Optimal stock control and procurement by reusing of obsolescences in manufacturing 86
Capacitated Lot Sizing and Scheduling with Parallel Machines and Shared Buffers: a Case Study in a Packaging Company 84
Driving the selection of COTS on the basis of system requirements 83
The Electric Vehicle Relocation Problem in Carsharing Systems with Collaborative Operators 83
Scheduling and Control of Material Handling in a Flexible Manufacturing Cell 81
On LP Relaxations for the Pattern Minimization Problem 81
A note on LP relaxations for the 1D cutting stock problem with setup costs 80
Optimization of obsolete part reusing: a case-study 80
A column generation approach for the multiple depot crew scheduling problem: a case study 79
Bin Packing with due dates 79
A Matheuristic Approach for Resource Scheduling and Design of a Multi-energy System 79
Static analysis by abstract interpretation: a mathematical programming approach 78
The Collaborative Relocation in One-Way Electric Carsharing Systems 78
A computational study on the duty generation for the multi-depot bus driver scheduling problem 77
One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model 77
A general framework for combined module- and scale-based product platform design 76
Maximum lateness minimization in one-dimensional bin packing 76
Optimization Models for Cut Sequencing 75
Bin Packing Problems with Variable Pattern Processing Times: A Proof-of-concept 75
A cycle-contraction heuristic for detecting an embedded reflected network matrix of maximum size 74
A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem 74
Robust stock assortment and cutting under defects in automotive glass production 73
Experimenting the Automated Selection of COTS Components Based on Cost and System Requirements 73
Cutting and Reusing: an Application from Automobile Component Manufacturing 73
A branch-and-price framework to solve a class of assortment problems 73
A branch-and-price algorithm for a class of assortment problems 73
A p-median model for waste minimization in the glass industry 72
Number of bins and maximum lateness minimization in two-dimensional bin packing 72
Cutting Stock with No Three Parts per Pattern: Work-in-process and Pattern Minimization 71
Applicazione di modelli di cutting e packing a sistemi manifatturieri 71
A tight reformulation of the power-and-frequency assignment problem in wireless networks 71
Analisi delle criticità e razionalizzazione delle decisioni nella lavorazione del vetro: il caso Pilkington 70
Scheduling commands on a satellite constellation 69
A branch-and-price algorithm for multicommodity facility location 66
A mathematical programming model for computing fixed points in static program analysis 65
Quantifying the Influence of Failure Repair/Mitigation Costs on Service-Based Systems 65
Integrating Process Optimization and Inventory Planning in Cutting-Stock with Skiving Option: an Optimization Model and its Application 65
Mathematical programming based debugging 64
Maximum lateness minimization in one-dimensional Bin Packing problems 64
An improvement on "Integrated production strategy and reuse scenario: A CoFAQ model and case study of mail server system development" 64
Software architecture quality of service analysis based on optimization models 64
LP-based dual bounds for the maximum quasi-clique problem 64
A pattern-based reformulation for the one-dimensional bin packing with variabile pattern processing time 63
Trim loss minimization under a given number of open stacks 62
A star-based reformulation for the maximum quasi-clique problem 60
Exploiting star inequalities for the maximum quasi-clique problem 60
An optimization model for the short-term hydrothermal unit commitment problem 59
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems 59
Optimizing vehicle relocations in one-way electric carsharing systems 59
On cutting stock with due dates 58
Mathematical programming: Turing completeness and applications to software analysis 57
A solution representation and an efficient evaluation method for the two-dimensional bin packing problem with guillotine cut and partial order constraints 57
A Sequential Heuristic for the Efficient Management of a Work Center’s Stocking Area 56
Mixed integer programs for cutting and scheduling optimization 55
Batch scheduling in a cutting process with finite buffers 55
Cutting stock with no three parts per patterns: work-in-process and pattern minimization 53
Mathematical Programming: Turing-completeness and Applications to Algorithmic Analysis 52
Optimizing Shelters and Evacuation Paths Against Flood in Historic Urban Built Environments 51
Cutting stock with part-type scheduling 48
A novel approach for multi-stage investment decisions and dynamic variations in medium-term energy planning for multi-energy carriers community 47
Cutting stock with bounded open stacks: a new integer linear programming model 47
Integrating cutting and inventory planning: an optimization model 45
Optimizing the manufacturing process of a cutting machine in iron industry. 45
Power and frequency assignment in broadcasting networks by branch-and-price 44
Uno schedulatore multimissione per la costellazione GALILEO 43
A robust optimization model for the assortment and cut of defective sheets in glass production 43
Mean completion time minimization as a graph ordering problem 42
On hierarchical waste-and-pattern minimization with two part types per stock item 42
Optimal allocation of the unloading buffers of a cutting machine in iron manufacturing. 41
Assortment and Cut of Defective Stocks by Bilevel Programming 40
Cutting stock with bounded open stacks 40
One-dimensional stock cutting resilient against singular random defects 39
A sequential value correction heuristic for a two dimensional cutting process with defective plates 39
One-dimensional bin packing with pattern-dependent processing time 38
On one-dimensional cutting stock with due dates 38
Optimization models for an assort-and-cut problem in glass manufacturing with defective raw material 38
Selection and cut of defective glass sheet via robust optimization 35
On pattern reconfiguration in one-dimensional cutting stock patterns 34
Bins and lateness minimization in one-dimensional packing problems with pattern-dependent processing times 34
Totale 6.978
Categoria #
all - tutte 37.708
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 37.708


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020112 0 0 0 0 0 0 0 0 0 0 0 112
2020/2021984 52 111 134 8 119 26 116 53 118 73 131 43
2021/2022648 45 187 6 23 11 24 26 39 50 26 65 146
2022/20231.344 116 107 107 95 100 317 2 69 288 9 98 36
2023/2024903 131 16 62 97 129 124 24 21 7 30 44 218
2024/20251.779 172 136 86 23 51 89 116 72 437 138 270 189
Totale 7.034