IRIS
RINALDI, Franca
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.711
EU - Europa 814
AS - Asia 149
Continente sconosciuto - Info sul continente non disponibili 3
OC - Oceania 3
Totale 3.680
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.684
IT - Italia 234
UA - Ucraina 205
SE - Svezia 105
DE - Germania 92
CN - Cina 80
FI - Finlandia 69
IE - Irlanda 35
TR - Turchia 31
CA - Canada 27
GB - Regno Unito 27
FR - Francia 17
VN - Vietnam 12
BE - Belgio 10
SG - Singapore 9
IN - India 6
IR - Iran 6
RU - Federazione Russa 4
AT - Austria 3
AU - Australia 3
EU - Europa 3
CH - Svizzera 2
CZ - Repubblica Ceca 2
GR - Grecia 2
ID - Indonesia 2
NL - Olanda 2
RO - Romania 2
SI - Slovenia 2
TW - Taiwan 2
ES - Italia 1
JP - Giappone 1
Totale 3.680
Salva come PNG Salva come JPEG
Città #
Fairfield 378
Woodbridge 360
Houston 232
Ann Arbor 226
Chandler 162
Ashburn 151
Jacksonville 143
Seattle 139
Cambridge 136
Wilmington 132
Dearborn 74
Udine 72
New York 48
Beijing 38
Princeton 36
Dublin 32
Izmir 31
Ottawa 23
Trieste 23
Selvazzano Dentro 18
San Diego 17
Des Moines 13
Boardman 12
Dong Ket 12
Ogden 11
Brussels 10
Kunming 9
Norwalk 9
Helsinki 8
San Jose 8
Singapore 8
Hefei 7
Scuola 7
Giessen 6
Nanjing 6
Rome 5
Torino 5
Monfalcone 4
Redwood City 4
Cork 3
Falls Church 3
Milan 3
Montpellier 3
Paris 3
Portsmouth 3
Sacile 3
Verona 3
Vienna 3
Villeurbanne 3
Bekasi 2
Caserta 2
Chennai 2
Chongqing 2
Frankfurt am Main 2
Hyderabad 2
Jinan 2
Lancaster 2
Leawood 2
Ljubljana 2
Los Angeles 2
Melbourne 2
Nanchang 2
Pordenone 2
Prague 2
Saint-Etienne-de-Valoux 2
Sassari 2
Tehran 2
Thessaloniki 2
Timisoara 2
Toronto 2
Turin 2
Venezia 2
Wuhan 2
Zanjan 2
Zurich 2
Albuquerque 1
Amsterdam 1
Andover 1
Atlanta 1
Bremen 1
Cavarzere 1
Chengdu 1
Columbus 1
Dresden 1
Eden Prairie 1
Foshan 1
Fuzhou 1
Grafing 1
Hebei 1
Henderson 1
Indiana 1
Kish 1
London 1
Monmouth Junction 1
Montreal 1
Mumbai 1
Naples 1
Nizhniy Novgorod 1
Novara 1
Odesa 1
Totale 2.722
Salva come PNG Salva come JPEG
Nome #
Vulnerability and power on networks 185
A Facility Location Model for Air Pollution Detection 161
Solving the train marshalling problem by inclusion-exclusion 156
A Dynamic Game Model for Distribution Problems with NonStochastic Uncertainty 140
A time-indexed LP-based approach for min-sum job-shop problems 137
Control of constrained dynamic production networks 133
Robust control of production-distribution systems 132
On the normal subgroup lattice of a hypercentral p-group 130
Local search inequalities 128
"An Exact Algorithm for the Min-Cost Network Containment Problem 127
A unified integer programming model for genome rearrangement problems 125
A two-dimensional strip cutting problem with sequencing constraint 122
Scheduling school meetings 118
A dynamic model for periodic flow with uncertainties 110
Feedback control of production--distribution systems with unknown demand and delays 106
The Image Containment Problem and some classes of polynomial instances 104
Flipping letters to minimize the support of a string 101
Guaranteed cost control for multi--inventory systems with uncertain demand 99
A feedback strategy for periodic network flows 94
A network design problem for a distribution system with uncertain demands 91
Least inventory control of multi-storage systems with non-stochastic unknown inputs 91
FEEDBACK CONTROL OF PRODUCTION-DISTRIBUTION SYSTEMS WITH UNKNOWN DEMAND AND DELAYS 90
Stabilization of multi-inventory systems with uncertain demand and setups 90
Flipping letters to minimize the support of a string 88
Control policies for multi-inventory systems with uncertain demand and setups 85
A time indexed model for Open Shop and Job Shop with three operations 83
Scheduling team meetings in a rehabilitation center 79
Guaranteed cost control for multi-inventory systems with uncertain demand 78
Least Inventory control of multi-storage systems with non-stochastic unknown inputs 77
A disturbance rejection approach in the control of production-distribution system with uncertain demand 65
NEW IDEAS TO SPEED-UP FLOYD-WARSHALL SHORTEST PATHS ALGORITHM 63
Integer Programming Models For Sorting Permutations And Genome Rearrangement Problems 62
A tabu search procedure for the TSP with time windows 61
An ILP-based proof that 1-tough 4-regular graphs of at most 17 nodes are Hamiltonian 59
A compact optimization approach for jobshop problems 58
Using Integer Programming to Search for Counterexamples: A Case Study 54
A Fast and Exact Greedy Algorithm for the Core–Periphery Problem 32
An ILP Approach to Determine Smallest 4-Regular Nonhamiltonian, Nontraceable, and Nonhomogeneously Taceable Graphs 15
Totale 3.729
Salva come PNG Salva come JPEG
Categoria #
all - tutte 10.240
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 10.240
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020993 69 66 46 136 67 149 115 108 69 72 24 72
2020/2021676 21 120 38 60 23 67 25 52 104 73 51 42
2021/2022411 19 29 13 76 5 12 25 12 3 56 116 45
2022/2023379 43 31 21 49 28 86 3 30 53 3 14 18
2023/2024203 24 17 9 7 15 61 2 3 15 15 16 19
2024/20255 5 0 0 0 0 0 0 0 0 0 0 0
Totale 3.729