NICOSIA, GAIA
 Distribuzione geografica
Continente #
NA - Nord America 7.804
EU - Europa 7.661
AS - Asia 4.880
SA - Sud America 595
AF - Africa 153
OC - Oceania 14
Continente sconosciuto - Info sul continente non disponibili 5
Totale 21.112
Nazione #
US - Stati Uniti d'America 7.731
CN - Cina 2.606
DK - Danimarca 1.963
RU - Federazione Russa 1.598
GB - Regno Unito 1.503
SG - Singapore 1.376
SE - Svezia 644
DE - Germania 554
VN - Vietnam 511
BR - Brasile 481
IT - Italia 442
UA - Ucraina 313
FI - Finlandia 165
IE - Irlanda 109
CI - Costa d'Avorio 107
AL - Albania 84
HK - Hong Kong 81
KR - Corea 53
TR - Turchia 53
FR - Francia 52
AR - Argentina 50
IN - India 49
NL - Olanda 47
CA - Canada 44
BE - Belgio 38
AT - Austria 33
ID - Indonesia 24
JP - Giappone 23
MX - Messico 23
BD - Bangladesh 21
PL - Polonia 21
LT - Lituania 18
CZ - Repubblica Ceca 17
EC - Ecuador 17
ZA - Sudafrica 16
AU - Australia 14
ES - Italia 14
IQ - Iraq 14
KW - Kuwait 14
PY - Paraguay 11
RO - Romania 10
PK - Pakistan 9
CL - Cile 8
EG - Egitto 8
PE - Perù 8
CO - Colombia 7
VE - Venezuela 7
KE - Kenya 6
AE - Emirati Arabi Uniti 5
LU - Lussemburgo 5
PT - Portogallo 5
SI - Slovenia 5
UY - Uruguay 5
A2 - ???statistics.table.value.countryCode.A2??? 4
AZ - Azerbaigian 4
IL - Israele 4
JO - Giordania 4
MA - Marocco 4
MD - Moldavia 4
NP - Nepal 4
SA - Arabia Saudita 4
UZ - Uzbekistan 4
CH - Svizzera 3
IR - Iran 3
PS - Palestinian Territory 3
TN - Tunisia 3
BA - Bosnia-Erzegovina 2
ET - Etiopia 2
GT - Guatemala 2
KZ - Kazakistan 2
LV - Lettonia 2
NO - Norvegia 2
OM - Oman 2
SN - Senegal 2
BB - Barbados 1
BG - Bulgaria 1
BI - Burundi 1
BO - Bolivia 1
BW - Botswana 1
CG - Congo 1
CR - Costa Rica 1
DZ - Algeria 1
EE - Estonia 1
EU - Europa 1
GN - Guinea 1
GR - Grecia 1
HN - Honduras 1
HR - Croazia 1
HU - Ungheria 1
IM - Isola di Man 1
KG - Kirghizistan 1
LK - Sri Lanka 1
MK - Macedonia 1
MN - Mongolia 1
MT - Malta 1
MY - Malesia 1
NI - Nicaragua 1
PH - Filippine 1
QA - Qatar 1
TW - Taiwan 1
Totale 21.112
Città #
Southend 1.296
Woodbridge 948
Fairfield 847
Ashburn 725
Wilmington 536
Singapore 531
Houston 494
Ann Arbor 469
Chandler 435
Seattle 414
Nanjing 365
Cambridge 332
Beijing 329
Hefei 311
Boardman 255
Dearborn 239
Jacksonville 238
Dong Ket 234
Rome 183
Princeton 170
Moscow 145
Shenyang 145
Nanchang 143
Dallas 140
Jinan 124
Hebei 119
Changsha 111
Dublin 107
Bremen 104
Ho Chi Minh City 102
Plano 99
Hong Kong 81
Tianjin 79
Helsinki 69
Jiaxing 67
Orange 63
Guangzhou 60
Redwood City 56
Hanoi 55
Seoul 53
Los Angeles 52
New York 49
São Paulo 47
Munich 46
Zhengzhou 46
Shanghai 45
The Dalles 45
Izmir 40
Kunming 38
London 37
San Diego 37
Brussels 34
Hangzhou 34
Milan 32
Haikou 30
Taizhou 29
Chicago 26
Ningbo 26
Lanzhou 22
Stockholm 22
Altamura 21
San Paolo di Civitate 20
Tokyo 20
Warsaw 20
Eitensheim 19
Ancona 18
Brooklyn 17
Da Nang 17
Fuzhou 17
Santa Clara 17
Taiyuan 17
Brno 16
Denver 16
Montreal 16
Orem 16
Poplar 16
Turku 16
Biên Hòa 15
Boston 15
Columbus 14
Johannesburg 14
Rio de Janeiro 14
Venezia 14
Walnut 14
Belo Horizonte 12
Chennai 12
Hawalli 12
Nuremberg 12
Toronto 12
Pune 11
Graz 10
Amsterdam 9
Atlanta 9
Curitiba 9
Flushing 9
Frankfurt am Main 9
Mexico City 9
Mumbai 9
Phoenix 9
Verona 9
Totale 12.571
Nome #
10th cologne-twente workshop on graphs and combinatorial optimization (CTW 2011) 345
Two Agents Competing for a Shared Machine 328
10th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011) 323
A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models 291
An exact algorithm for a multicommodity min-cost flow over time problem 285
Cheapest paths in dynamic networks 283
Price of Fairness for allocating a bounded resource 281
Competitive multi-agent scheduling with an iterative selection rule 276
Maximin Fairness-profit Tradeoff in Project Budget Allocation 274
Brief announcement: the fair subset sum problem 273
A job-shop problem with one additional resource type 269
Scheduling three chains on two parallel machines 264
Profit-fairness trade-off in project selection 255
Assessing the quality of heuristic solutions to parallel machines min-max scheduling problems 253
A Heuristic Approach to Batching and Scheduling a Single Machine to Minimize Setup Costs 242
An approximate A* algorithm and its application to the SCS problem, 241
Strategies in Competing Subset Selection 240
On-line load balancing made simple: Greedy strikes back 240
Optimally balancing assembly lines with different workstations 239
Optimally Balancing Assembly Lines with Different Workstations 239
Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines 238
On-line load balancing made simple: Greedy strikes back 237
Optimal power control in OFDMA cellular networks 235
Exact algorithms for a discrete metric labeling problem 235
Robust single machine scheduling with external-party jobs 234
Decentralized route guidance algorithms in urban transportation networks 230
Local Restoration for Trees and Arborescences 228
Robust paths in urban transportation networks 226
Robust single machine scheduling with a flexible maintenance activity 224
Decentralized algorithms for multiple path routing in urban transportation networks 223
Scheduling tasks with comb precedence constraints on dedicated machines 222
On multicriteria online problems 222
Subset Weight Maximization with Two Competing Agents 222
Cyclic Schedules for Pipeline Assembly Processes 220
Price of fairness in two-agent single-machine scheduling problems 216
Stable Routing under the Spanning Tree Protocol 212
Competitive algorithms for the bicriteria k-server problem 211
Exact algorithms for a discrete metric labeling problem 209
Sequencing a batching flexible cell to minimise set-up costs 207
Cellular Radio Resource Allocation Problem 207
Optimal channel allocation in OFDMA multi-cell systems 207
An exact algorithm for a multicommodity min-cost flow over time problem 207
Build or merge: Locational decisions in mobile access networks 207
On a Stackelberg Subset Sum Game 205
On the bicriteria k-server problem 202
Minimizing Part Transfer Costs in Flexible Manufacturing Systems: A Computational Study on Different Lower Bounds 202
A branch and bound algorithm for a generalized Job Shop Scheduling problem 202
The Subset Sum game 202
Maximin fairness in project budget allocation 202
Strategies for single-machine multi-agent scheduling problems 201
Parallel dedicated machines scheduling with chain precedence constraints 201
Efficient offline algorithms for the bicriteria k-server problem and online applications 200
A column generation approach to a class of single-machine preemptive scheduling problems 200
Competitive subset selection with two agents 197
Minimum Cost Multi-Product Flow Lines 196
A multi-resource Job Shop Scheduling Problem 195
Minimum cost subset selection with two competing agents 194
Minimum Cost Paths Over Dynamic Networks 194
Scheduling Two Agent Task Chains with a Central Selection Mechanism 193
Single machine scheduling problems with generalized preemption 193
Two Agent Scheduling with a Central Selection Mechanism 193
A branch and bound algorithm for a generalized Job Shop Scheduling problem 191
Exact algorithms for a discrete metric labeling problem 191
Competitive algorithms for the bicriteria k-server problem 190
Local Restoration for Trees and Arborescences 190
Scheduling Two Chains on m Machines 187
Minimum cost paths over dynamic networks 187
Maximin Fairness in Project Budget Allocation 187
Swapping failing arcs in shortest path arborescences 184
On the Stackelberg knapsack game 184
Single machine scheduling problems with generalized preemption 183
Single machine scheduling problems with generalized preemption 179
Subset Weight Maximization with Two Competing Agents 176
Part batching and scheduling in a flexible cell to minimize setup costs 173
Scheduling two chains on parallel dedicated machines 172
On a resource-constrained Job Shop Scheduling Problem 172
Price of Fairness for Multiagent Subset Sum Problems 165
Lower bounds for a meal pickup-and-delivery scheduling problem 162
Radio Resource Allocation in OFDMA Cellular Systems 161
Coordinamento di una supply network nel settore del fashion 160
Two Agents Single Machine Scheduling under a Coordination Mechanism 160
On-line scheduling with setup costs 159
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. 157
Optimal allocation plan for distribution centers of a frozen food company 152
Parallel Dedicated Machines Scheduling with Task-Precedence Constraints 152
Optimal channel allocation in OFDMA multi-cell systems 151
A Stackelberg knapsack game with weight control 150
A COMPARISON OF EXACT AND HEURISTIC METHODS FOR A FACILITY LOCATION PROBLEM 145
Local Restoration for Trees and Arborescences under the Spanning Tree Protocol 143
Two Stackelberg Knapsack games 133
Coordinating stakeholders in a fashion supply network 131
Single machine scheduling with bounded job rearrangements 126
The price of fairness in two-agent scheduling 123
Optimally rescheduling jobs with a Last-In-First-Out buffer 117
The Price of Fairness in a Two-Agent Single-Machine Scheduling Problem . 116
Simulation-based optimization for solid organ transplantation management 115
Constrained Job Rearrangements on a Single Machine 115
Mass Vaccine Administration under Supply Uncertainty 113
On multi-agent knapsack problems 109
Optimally rescheduling jobs under LIFO constraints 108
Totale 20.161
Categoria #
all - tutte 61.671
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 61.671


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.301 0 0 0 0 0 112 268 182 244 128 68 299
2021/20221.175 51 153 32 16 239 33 144 50 93 45 82 237
2022/20231.666 235 319 112 214 109 287 7 145 150 8 56 24
2023/2024804 34 48 68 27 44 90 47 226 15 33 43 129
2024/20253.049 22 56 306 67 85 110 1.052 640 264 48 178 221
2025/20263.550 505 719 321 1.002 571 432 0 0 0 0 0 0
Totale 21.754