ARBIB, CLAUDIO
 Distribuzione geografica
Continente #
NA - Nord America 2.840
EU - Europa 1.744
AS - Asia 1.117
SA - Sud America 32
Continente sconosciuto - Info sul continente non disponibili 8
OC - Oceania 3
AF - Africa 1
Totale 5.745
Nazione #
US - Stati Uniti d'America 2.838
IE - Irlanda 703
CN - Cina 376
SG - Singapore 315
TR - Turchia 304
DE - Germania 201
IT - Italia 199
UA - Ucraina 167
GB - Regno Unito 151
SE - Svezia 131
FI - Finlandia 92
HK - Hong Kong 84
FR - Francia 51
BR - Brasile 26
IN - India 21
BE - Belgio 17
RU - Federazione Russa 6
EU - Europa 5
CH - Svizzera 4
A2 - ???statistics.table.value.countryCode.A2??? 3
AT - Austria 3
CZ - Repubblica Ceca 3
PL - Polonia 3
RO - Romania 3
AU - Australia 2
ES - Italia 2
JP - Giappone 2
KR - Corea 2
PK - Pakistan 2
RS - Serbia 2
TW - Taiwan 2
VN - Vietnam 2
AR - Argentina 1
BD - Bangladesh 1
BO - Bolivia 1
CA - Canada 1
CO - Colombia 1
DK - Danimarca 1
IL - Israele 1
IR - Iran 1
KG - Kirghizistan 1
KZ - Kazakistan 1
LT - Lituania 1
MD - Moldavia 1
MX - Messico 1
NO - Norvegia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
PE - Perù 1
PH - Filippine 1
PY - Paraguay 1
SK - Slovacchia (Repubblica Slovacca) 1
SM - San Marino 1
TN - Tunisia 1
VE - Venezuela 1
Totale 5.745
Città #
Dublin 699
Jacksonville 664
Chandler 572
Singapore 268
Boardman 208
Santa Clara 190
Izmir 140
Nanjing 118
San Mateo 114
Wilmington 89
Princeton 88
Lawrence 87
Hong Kong 84
Ann Arbor 73
New York 52
Milan 36
Ashburn 35
Mountain View 34
Nanchang 34
Shenyang 32
L'aquila 29
Jiaxing 21
Tianjin 20
Woodbridge 20
Hebei 19
Seattle 19
Des Moines 18
Helsinki 18
Rome 18
Los Angeles 17
Brussels 16
Kunming 15
Verona 15
Zhengzhou 14
Grafing 12
Beijing 11
Changsha 11
Venezia 10
Norwalk 9
Shanghai 9
Falls Church 8
L’Aquila 8
Aquila 7
Dearborn 7
Jinan 7
Taizhou 7
Changchun 6
Dallas 6
Saarbrücken 6
Bergamo 5
Chieti 5
Houston 5
Istanbul 5
Munich 5
Ningbo 5
Paganica 5
Pune 5
Stockholm 5
Dalian 4
Frankfurt am Main 4
Fremont 4
Guangzhou 4
Hangzhou 4
Napoli 4
Popoli 4
Auburn Hills 3
Belp 3
Düsseldorf 3
Redwood City 3
Rio De Janeiro 3
Warsaw 3
Atlanta 2
Belgrade 2
Berlin 2
Bremen 2
Brno 2
Cambridge 2
Cava de' Tirreni 2
Dong Ket 2
Edinburgh 2
Espoo 2
Fairfield 2
Haikou 2
Lanzhou 2
Nuremberg 2
Phoenix 2
San Francisco 2
Taipei 2
Tappahannock 2
Vienna 2
Almaty 1
Alvorada 1
Andover 1
Aprilia 1
Araputanga 1
Asunción 1
Auckland 1
Bari 1
Baskent 1
Belo Horizonte 1
Totale 4.139
Nome #
A Competitive Scheduling Problem and its Relevance to UMTS Channel Assignment 119
Polynomial Algorithms for Special Cases of the Balanced Bipartite Subgraph Problem 103
On Cutting Stock with Due Dates 102
Sorting Common Operations to Minimize the Number of Tardy Jobs 97
One-dimensional cutting stock with a limited number of open stacks: Bounds and solutions from a new integer linear programming model 97
Optimal Resource Assignment through Negotiation in a Multi-agent Manufacturing System 93
Combinatorial Optimization and Application: in memory of Mario Lucertini 87
Task Assignment and Sub-assembly Scheduling in Flexible Assembly Lines 86
A Polynomial Characterization of Some Graph Partitioning Problems 85
An Optimization Model for Trim Loss Minimization in an Automotive Glass Plant 84
On the Stability Number of the Edge Intersection of Two Graphs 83
Optimal Part Routing in FMS 82
An LP-based Tabu Search for Batch Scheduling in a Cutting Process with Finite Buffers 81
Maximum lateness minimization in one-dimensional bin packing 80
An improved integer linear programming formulation for the closest 0-1 string problem 80
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization 78
Scheduling Two Chains of Unit Jobs on One Machine: A Polyhedral Study 75
On the upper chromatic number of (v3,b2)-configurations 74
Optimal Two-machine Scheduling in a Flexible Flow System 73
A p-median model for waste minimization in the glass industry 72
Predicting deadlock in store-and-forward networks 71
Graph Visitability 71
Mixed integer programs for cutting and scheduling optimization 69
Competitive location and pricing on a line with metric transportation costs 69
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems 68
Integrating Process Optimization and Inventory Planning in Cutting-stock with Skiving Option: an Optimization Model and its Application 68
Modelli matematici per ridurre gli sfridi da operazioni di taglio e razionalizzare i formati nell'industria del vetro 67
The directed profitable location Rural Postman Problem 67
A Bound on the Stability Number of Graphs with Boxicity k: an Exercise 66
The Lazy Cook Problem: Scheduling Parallel Machines to Minimize Vehicle Utilization 66
Toward Effective Response to Natural Disasters: A Data Science Approach 66
A three-dimensional matching model for perishable production scheduling 65
Predicting Deadlock in Store-and-forward Networks 65
A branch-and-price algorithm for a class of assortment problems 65
A branch-and-price framework to solve a class of assortment problems 65
Minimum Flow Time Graph Ordering 65
The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization 64
A Polynomial Algorithm for Partitioning Line-graphs 64
Distributing Material Flows in a Manufacturing System with Large Product Mix: Two Models Based on Column Generation 64
On (P5, diamond)-free Graphs 63
Part Routing in Flexible Assembly Systems 63
Riduzione degli Sfridi da Operazioni di Taglio: Modelli di Ottimizzazione e Applicazioni Industriali 63
An optimization model for the short-term hydrothermal unit commitment problem 63
Applying a network flow model to quick and safe evacuation of people from a building: a real case 63
QoS Provision and IP Multimedia Services in FUTURE - Physical Demonstrator Architecture for Experiments 62
Integrating cutting and inventory planning: an optimization model 61
An IoT Software Architecture for an Evacuable Building Architecture 61
Methodological Aspects of Ring Network Design 60
Cutting stock with part-type scheduling 60
Controlling open stacks and flow time in a cutting process 60
Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs 60
Almost always observable hybrid systems 60
How to Survive while Visiting a Graph 60
A note on LP relaxations for the 1D cutting stock problem with setup costs 60
Combinatorial Models for Manufacturing: Optimizing Flow Management in Flexible Production Systems 59
Mean completion time minimization as a graph ordering problem 59
On LP Relaxations for the Pattern Minimization Problem 59
Workload Balancing and Part Transfer Minimization in Flexible Manufacturing Systems 59
On envy-free perfect matching 59
Concurrent Operations Assignment and Sequencing for Particular Assembly Problems in Flow Lines 59
Two Polynomial Problems in PLA Folding 58
Task Assignment in Pipeline Assembly Systems 58
A QoS Concept for Packet Oriented S-UMTS Services 58
Trim loss minimization under a given number of open stacks 57
Framework of Resource Management for S-UMTS 57
Cutting and Reuse: an Application from Automotive Component Manufacturing 57
Scheduling and Control of Material Handling in a Flexible Manufacturing Cell 57
An Optimization Problem Arising in the Design of Multiring Systems 57
Definition of an Enriched GIS Network for Evacuation Planning 57
On one-dimensional cutting stock with due dates 56
Meta-reasoning and Data Structuring for Improving PROLOG Programming Style 55
Optimum solution of the closest string problem via rank distance 55
Sorting Common Operations to Minimize Tardy Jobs 54
A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks 54
Number of bins and maximum lateness minimization in two-dimensional bin packing 54
Recent Contributions of OR to Network Optimization, feature issue of the European J. of Operational Research 53
Tool loading problems in FMS and VLSI circuit layout problems 53
Mold and Job Scheduling in Plastic Printing: a Column Generation Approach 52
On hierarchical waste-and-pattern minimization with two part types per stock item 51
Optimal Multiplexing of Packetized Traffics with Different Requirements 51
The Combinatorial Approach to Flow Management in FMS 47
Codon optimization by 0-1 linear programming 47
Real-time emergency response through performant IoT architectures 47
IoT Flows: a network model application to building evacuation 45
A dynamic dial-a-ride model for optimal vehicle routing in a wafer fab 43
Optimization Models for Cut Sequencing 42
Optimizing multichamber work cell management: An application to a DRAM wafer fab 34
Classification of tumor types using XGBoost machine learning model: a vector space transformation of genomic alterations 33
null 30
Problems with a Slanting Hat 25
Robust stock assortment and cutting under defects in automotive glass production 24
A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout 15
One-dimensional stock cutting resilient against singular random defects 13
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators 8
Totale 5.826
Categoria #
all - tutte 24.522
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 24.522


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020284 0 0 0 0 0 0 102 4 86 7 3 82
2020/2021659 7 85 0 91 86 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/2025776 33 35 148 48 283 130 99 0 0 0 0 0
Totale 5.826