ARBIB, CLAUDIO
 Distribuzione geografica
Continente #
NA - Nord America 3.580
EU - Europa 2.086
AS - Asia 2.022
SA - Sud America 256
AF - Africa 34
Continente sconosciuto - Info sul continente non disponibili 8
OC - Oceania 3
Totale 7.989
Nazione #
US - Stati Uniti d'America 3.538
SG - Singapore 946
IE - Irlanda 705
CN - Cina 455
TR - Turchia 323
IT - Italia 239
DE - Germania 222
RU - Federazione Russa 218
BR - Brasile 216
UA - Ucraina 170
GB - Regno Unito 167
SE - Svezia 136
HK - Hong Kong 126
FI - Finlandia 103
FR - Francia 53
VN - Vietnam 47
IN - India 42
CA - Canada 30
BE - Belgio 20
JP - Giappone 19
AR - Argentina 15
ZA - Sudafrica 13
BD - Bangladesh 12
PL - Polonia 12
ES - Italia 9
IQ - Iraq 9
MX - Messico 9
UZ - Uzbekistan 7
EC - Ecuador 6
KR - Corea 6
VE - Venezuela 6
EU - Europa 5
NL - Olanda 5
CH - Svizzera 4
KG - Kirghizistan 4
MA - Marocco 4
PK - Pakistan 4
A2 - ???statistics.table.value.countryCode.A2??? 3
AT - Austria 3
BO - Bolivia 3
CZ - Repubblica Ceca 3
DZ - Algeria 3
EG - Egitto 3
GE - Georgia 3
KE - Kenya 3
LT - Lituania 3
PE - Perù 3
RO - Romania 3
TN - Tunisia 3
AE - Emirati Arabi Uniti 2
AU - Australia 2
AZ - Azerbaigian 2
CO - Colombia 2
ET - Etiopia 2
IL - Israele 2
PH - Filippine 2
PY - Paraguay 2
RS - Serbia 2
SA - Arabia Saudita 2
SK - Slovacchia (Repubblica Slovacca) 2
TW - Taiwan 2
UY - Uruguay 2
BB - Barbados 1
BH - Bahrain 1
BN - Brunei Darussalam 1
CL - Cile 1
CV - Capo Verde 1
DK - Danimarca 1
EE - Estonia 1
GR - Grecia 1
HN - Honduras 1
IR - Iran 1
JM - Giamaica 1
KZ - Kazakistan 1
LA - Repubblica Popolare Democratica del Laos 1
LB - Libano 1
MD - Moldavia 1
NG - Nigeria 1
NO - Norvegia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
PT - Portogallo 1
SM - San Marino 1
SN - Senegal 1
Totale 7.989
Città #
Dublin 701
Jacksonville 664
Chandler 572
Singapore 516
Dallas 310
Boardman 208
Santa Clara 198
Izmir 140
Hong Kong 126
Nanjing 118
San Mateo 114
Ashburn 113
Wilmington 89
Princeton 88
Lawrence 87
The Dalles 85
Ann Arbor 73
New York 71
Moscow 46
Los Angeles 39
Milan 39
Mountain View 34
Nanchang 34
Shenyang 32
L'aquila 29
Rome 28
Helsinki 26
Seattle 25
Beijing 24
Hefei 24
Jiaxing 21
São Paulo 21
Ho Chi Minh City 20
L’Aquila 20
Tianjin 20
Woodbridge 20
Brussels 19
Hebei 19
Des Moines 18
Tokyo 17
Kunming 15
Verona 15
San Francisco 14
Zhengzhou 14
Columbus 13
Montreal 13
Grafing 12
Istanbul 12
Changsha 11
Warsaw 11
Chennai 10
Munich 10
Stockholm 10
Venezia 10
Council Bluffs 9
Frankfurt am Main 9
Norwalk 9
Phoenix 9
Shanghai 9
Brooklyn 8
Falls Church 8
Johannesburg 8
Aquila 7
Dearborn 7
Hanoi 7
Houston 7
Jinan 7
Taizhou 7
Ankara 6
Belo Horizonte 6
Changchun 6
Falkenstein 6
Pune 6
Rio de Janeiro 6
Saarbrücken 6
San Jose 6
Tashkent 6
Atlanta 5
Bergamo 5
Brasília 5
Chieti 5
Guangzhou 5
Mexico City 5
Ningbo 5
Paganica 5
Amsterdam 4
Bishkek 4
Biên Hòa 4
Boston 4
Curitiba 4
Dalian 4
Fremont 4
Hangzhou 4
London 4
Napoli 4
Orem 4
Pelotas 4
Poplar 4
Popoli 4
Secaucus 4
Totale 5.283
Nome #
A Competitive Scheduling Problem and its Relevance to UMTS Channel Assignment 148
Polynomial Algorithms for Special Cases of the Balanced Bipartite Subgraph Problem 122
One-dimensional cutting stock with a limited number of open stacks: Bounds and solutions from a new integer linear programming model 122
An improved integer linear programming formulation for the closest 0-1 string problem 121
On Cutting Stock with Due Dates 119
Maximum lateness minimization in one-dimensional bin packing 114
Sorting Common Operations to Minimize the Number of Tardy Jobs 113
Optimal Resource Assignment through Negotiation in a Multi-agent Manufacturing System 112
Toward Effective Response to Natural Disasters: A Data Science Approach 111
Competitive location and pricing on a line with metric transportation costs 109
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization 108
Combinatorial Optimization and Application: in memory of Mario Lucertini 108
On the upper chromatic number of (v3,b2)-configurations 107
Task Assignment and Sub-assembly Scheduling in Flexible Assembly Lines 107
Definition of an Enriched GIS Network for Evacuation Planning 107
On envy-free perfect matching 106
Optimal Part Routing in FMS 103
On the Stability Number of the Edge Intersection of Two Graphs 102
A Polynomial Characterization of Some Graph Partitioning Problems 102
Applying a network flow model to quick and safe evacuation of people from a building: a real case 102
An Optimization Model for Trim Loss Minimization in an Automotive Glass Plant 99
Codon optimization by 0-1 linear programming 99
Number of bins and maximum lateness minimization in two-dimensional bin packing 98
Almost always observable hybrid systems 97
An LP-based Tabu Search for Batch Scheduling in a Cutting Process with Finite Buffers 96
Optimal Two-machine Scheduling in a Flexible Flow System 95
An IoT Software Architecture for an Evacuable Building Architecture 95
Scheduling Two Chains of Unit Jobs on One Machine: A Polyhedral Study 93
Integrating Process Optimization and Inventory Planning in Cutting-stock with Skiving Option: an Optimization Model and its Application 93
A dynamic dial-a-ride model for optimal vehicle routing in a wafer fab 93
Minimum Flow Time Graph Ordering 91
Part Routing in Flexible Assembly Systems 90
Classification of tumor types using XGBoost machine learning model: a vector space transformation of genomic alterations 89
On (P5, diamond)-free Graphs 89
A branch-and-price algorithm for a class of assortment problems 89
Predicting Deadlock in Store-and-forward Networks 88
A p-median model for waste minimization in the glass industry 88
Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs 88
Real-time emergency response through performant IoT architectures 88
A three-dimensional matching model for perishable production scheduling 87
Modelli matematici per ridurre gli sfridi da operazioni di taglio e razionalizzare i formati nell'industria del vetro 86
QoS Provision and IP Multimedia Services in FUTURE - Physical Demonstrator Architecture for Experiments 86
Graph Visitability 86
A Bound on the Stability Number of Graphs with Boxicity k: an Exercise 85
Predicting deadlock in store-and-forward networks 85
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems 84
A branch-and-price framework to solve a class of assortment problems 84
A Polynomial Algorithm for Partitioning Line-graphs 84
Cutting and Reuse: an Application from Automotive Component Manufacturing 84
The directed profitable location Rural Postman Problem 83
Distributing Material Flows in a Manufacturing System with Large Product Mix: Two Models Based on Column Generation 83
Optimum solution of the closest string problem via rank distance 83
The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization 82
Methodological Aspects of Ring Network Design 82
Cutting stock with part-type scheduling 81
Mixed integer programs for cutting and scheduling optimization 80
Task Assignment in Pipeline Assembly Systems 79
The Lazy Cook Problem: Scheduling Parallel Machines to Minimize Vehicle Utilization 79
How to Survive while Visiting a Graph 79
Controlling open stacks and flow time in a cutting process 78
An Optimization Problem Arising in the Design of Multiring Systems 78
An optimization model for the short-term hydrothermal unit commitment problem 77
IoT Flows: a network model application to building evacuation 77
Two Polynomial Problems in PLA Folding 76
Integrating cutting and inventory planning: an optimization model 76
On LP Relaxations for the Pattern Minimization Problem 76
Workload Balancing and Part Transfer Minimization in Flexible Manufacturing Systems 76
Riduzione degli Sfridi da Operazioni di Taglio: Modelli di Ottimizzazione e Applicazioni Industriali 75
Framework of Resource Management for S-UMTS 75
A QoS Concept for Packet Oriented S-UMTS Services 75
Scheduling and Control of Material Handling in a Flexible Manufacturing Cell 75
A note on LP relaxations for the 1D cutting stock problem with setup costs 75
A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks 74
Mean completion time minimization as a graph ordering problem 73
Concurrent Operations Assignment and Sequencing for Particular Assembly Problems in Flow Lines 73
Combinatorial Models for Manufacturing: Optimizing Flow Management in Flexible Production Systems 72
Trim loss minimization under a given number of open stacks 72
Meta-reasoning and Data Structuring for Improving PROLOG Programming Style 72
Tool loading problems in FMS and VLSI circuit layout problems 72
Sorting Common Operations to Minimize Tardy Jobs 71
On hierarchical waste-and-pattern minimization with two part types per stock item 71
On one-dimensional cutting stock with due dates 70
Mold and Job Scheduling in Plastic Printing: a Column Generation Approach 69
The Combinatorial Approach to Flow Management in FMS 69
Optimization Models for Cut Sequencing 69
Optimal Multiplexing of Packetized Traffics with Different Requirements 67
Robust stock assortment and cutting under defects in automotive glass production 66
Recent Contributions of OR to Network Optimization, feature issue of the European J. of Operational Research 66
One-dimensional stock cutting resilient against singular random defects 60
A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout 53
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators 52
Optimizing multichamber work cell management: An application to a DRAM wafer fab 47
Problems with a Slanting Hat 37
null 30
Application of a Machine Learning-Based Approach for Source Reconstruction and Radiation Prediction by the Spherical Wave Expansion Technique 16
Totale 8.073
Categoria #
all - tutte 35.077
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 35.077


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021390 0 0 0 0 0 16 90 3 96 17 152 16
2021/2022467 16 47 49 20 17 32 14 30 33 6 40 163
2022/20231.740 115 73 45 167 121 208 4 98 826 9 51 23
2023/2024367 53 11 27 61 30 94 6 34 0 15 5 31
2024/20251.680 33 35 148 48 283 130 145 159 385 96 95 123
2025/20261.343 109 373 181 311 253 116 0 0 0 0 0 0
Totale 8.073