MARTELLO, SILVANO
 Distribuzione geografica
Continente #
NA - Nord America 7.577
AS - Asia 5.396
EU - Europa 5.251
AF - Africa 392
SA - Sud America 321
OC - Oceania 34
Continente sconosciuto - Info sul continente non disponibili 2
Totale 18.973
Nazione #
US - Stati Uniti d'America 7.497
SG - Singapore 1.692
CN - Cina 1.480
GB - Regno Unito 1.361
VN - Vietnam 911
IT - Italia 852
DE - Germania 765
HK - Hong Kong 478
SE - Svezia 434
UA - Ucraina 400
RU - Federazione Russa 322
IN - India 308
FR - Francia 283
BR - Brasile 243
IE - Irlanda 166
JP - Giappone 137
KR - Corea 121
ZA - Sudafrica 114
CI - Costa d'Avorio 103
NL - Olanda 94
EE - Estonia 91
CH - Svizzera 74
GR - Grecia 74
PL - Polonia 73
CA - Canada 54
JO - Giordania 47
FI - Finlandia 44
TR - Turchia 43
SC - Seychelles 41
AR - Argentina 39
MY - Malesia 35
NG - Nigeria 35
TG - Togo 35
BG - Bulgaria 32
AU - Australia 30
AT - Austria 26
PH - Filippine 26
DZ - Algeria 24
BE - Belgio 23
IL - Israele 23
MX - Messico 22
PT - Portogallo 22
ES - Italia 21
HR - Croazia 20
ID - Indonesia 18
IR - Iran 18
MA - Marocco 16
LB - Libano 13
HU - Ungheria 11
TN - Tunisia 9
CL - Cile 8
PE - Perù 8
RS - Serbia 8
CZ - Repubblica Ceca 7
DK - Danimarca 7
EG - Egitto 7
LT - Lituania 7
NO - Norvegia 7
EC - Ecuador 6
PY - Paraguay 6
RO - Romania 6
TW - Taiwan 6
LU - Lussemburgo 5
VE - Venezuela 5
BY - Bielorussia 4
CO - Colombia 4
PK - Pakistan 4
UZ - Uzbekistan 4
AE - Emirati Arabi Uniti 3
LK - Sri Lanka 3
SA - Arabia Saudita 3
BA - Bosnia-Erzegovina 2
BD - Bangladesh 2
BO - Bolivia 2
EU - Europa 2
KH - Cambogia 2
KW - Kuwait 2
KZ - Kazakistan 2
ML - Mali 2
MN - Mongolia 2
NZ - Nuova Zelanda 2
OM - Oman 2
QA - Qatar 2
SK - Slovacchia (Repubblica Slovacca) 2
TH - Thailandia 2
AL - Albania 1
AZ - Azerbaigian 1
BB - Barbados 1
BW - Botswana 1
CD - Congo 1
CY - Cipro 1
DM - Dominica 1
GA - Gabon 1
GE - Georgia 1
GH - Ghana 1
GI - Gibilterra 1
HT - Haiti 1
IQ - Iraq 1
IS - Islanda 1
KE - Kenya 1
Totale 18.961
Città #
Ann Arbor 1.211
Southend 1.154
Singapore 847
Fairfield 734
Ashburn 615
Hong Kong 443
Wilmington 383
Woodbridge 370
Chandler 363
Seattle 358
Dong Ket 324
Houston 317
Princeton 277
Jacksonville 274
Cambridge 273
Santa Clara 240
Hefei 238
Dallas 231
Beijing 214
Boardman 178
Dublin 160
Nanjing 137
Westminster 125
Bologna 122
Padova 122
Los Angeles 113
Tokyo 108
Abidjan 103
Ho Chi Minh City 99
Hanoi 85
Berlin 84
Milan 79
Seoul 79
Saint Petersburg 74
Medford 66
Buffalo 65
Bern 57
Jinan 57
Mülheim 56
Shenyang 51
Turin 49
Amman 47
San Diego 47
Changsha 45
Des Moines 43
Shanghai 43
Rome 39
Frankfurt am Main 37
Mahé 37
New York 36
Guangzhou 35
Hebei 35
Lomé 35
Nanchang 35
Helsinki 34
Redondo Beach 34
Sofia 31
Abeokuta 30
The Dalles 29
Munich 28
São Paulo 28
Bengaluru 24
Jiaxing 24
Dearborn 23
Tianjin 23
San Francisco 22
Yubileyny 22
Chicago 21
London 21
Brussels 20
Semenyih 19
Hangzhou 18
Leeds 18
Paris 18
Verona 17
Zhengzhou 17
Haikou 16
Villiers-sur-marne 15
Warsaw 15
Kunming 14
Lanzhou 14
Montreal 14
Phoenix 14
Rio de Janeiro 14
Vicenza 14
Falls Church 13
Ningbo 13
Olalla 13
San Venanzo 13
Istanbul 12
Norwalk 12
Porto 12
Athens 11
Fuzhou 11
La Crescenta-Montrose 11
Melbourne 11
Modena 11
Redwood City 11
Shenzhen 11
Chennai 10
Totale 12.275
Nome #
Bin Packing Approximation Algorithms: Survey and Classification. 775
Two-dimensional Bin Packing Problems 291
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems 237
BPPLIB: a library for bin packing and cutting stock problems 226
An optimization problem in the electricity market 221
Piecewise linear approximation of functions of two variables in MILP models 212
Combinatorial Traveling Salesman Problem Algorithms 212
Models and Bounds for Two-Dimensional Level Packing Problems 210
A case of plagiarism: Danut Marcu 210
A Free Educational Java Framework for Graph Algorithms 206
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem 202
Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems 200
A Fast and Efficient Algorithm to Exploit Multi-user Diversity in IEEE 802.16 BandAMC 197
4OR: A Quarterly Journal of Operations Research 196
4OR: A Quarterly Journal of Operations Research 196
An MILP Approach for Short-Term Hydro Scheduling and Unit Commitment With Head-Dependent Reservoir 195
The traveling salesman problem with pickups, deliveries, and draft limits 195
Training software for orthogonal packing problems 192
No 7-year itch at 4OR 188
Packing into the smallest square: Worst-case analysis of lower bounds 187
Optimal scheduling of a multiunit hydro power station in a short-term planning horizon 187
A note on exact algorithms for the identical parallel machine scheduling problem 185
Mathematical models and decomposition methods for the multiple knapsack problem 184
Tspack: A unified tabu search code for multi-dimensional bin packing problems 182
Heuristic algorithms and scatter search for the cardinality constrained PCmax problem 180
Ricerca Operativa per l’Economia e l’Impresa 180
Complexity and approximation of an area packing problem 180
Two-Dimensional Bin Packing Problems 178
A brand new cheating attempt: a case of usurped identity 174
Lower bounds and heuristic algorithms for the $k_i$-Partitioning problem 173
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem 169
Efficient two-dimensional data allocation in IEEE 802.16 OFDMA 169
Nuovi problemi di ottimizzazione per i produttori in un mercato competitivo dell’energia elettrica 168
Lower and upper bounds for the non-linear generalized assignment problem 168
Ricerca Operativa per la Laurea Magistrale 167
A tabu search algorithm for a routing and container loading problem 164
Optimistic MILP modeling of non-linear optimization problems 163
Nuovi problemi d’ottimizzazione per i produttori in un mercato competitivo dell’energia elettrica 162
A Tabu search heuristic for the Vehicle Routing Problem with two-dimensional loading constraints 160
Efficient two-dimensional packing algorithms for mobile WiMAX 158
Obituary: Stefano Pallottino 1945-2004 157
Relaxations and heuristics for the multiple non-linear separable knapsack problem 157
4OR: Year 4 155
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem 154
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem 152
4OR Quarterly Journal of the Belgian, French and Italian Operations Research Societies 151
Plagiarism again: Sreenivas and Srinivas, with an update on Marcu 151
Logic based Benders' decomposition for orthogonal stock cutting problems 150
Models and algorithms for packing rectangles into the smallest square 150
An aggregate label setting policy for the multi-objective shortest path problem 147
Computational advances in combinatorial optimization 146
Récentes avancées sur le problème de bin packing à deux dimensions. 145
4OR: A Quarterly Journal of Operations Research 140
4OR: A Quarterly Journal of Operations Research 138
An annotated bibliography of combined routing and loading problems 137
Sweet sixteen 137
Heuristic algorithms for the general nonlinear separable knapsack problems, 136
Models and algorithms for fair layout optimization problems 135
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems 133
Advances in combinatorial optimization 133
Assignment Problems - Revised Reprint 132
Assignment Problems 132
Computational Advances in Combinatorial Optimization 132
Eleven surveys in operations research: II 129
An iterated dual substitution approach for the min-max regret multidimensional knapsack problem 129
4OR: A Quarterly Journal of Operations Research 128
Routing problems with loading constraints 125
Bin packing and cutting stock problems: Mathematical models and exact algorithms 125
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem 124
The dirty dozen of 4OR 124
null 123
Algorithms for the min-max regret generalized assignment problem with interval data 123
Combinatorial optimization: theory, computation, and applications 122
Surveys in operations research 122
4OR: A Quarterly Journal of Operations Research 122
Linear programming approach for the transition from market-generated hourly energy programs to feasible power generation schedules 121
Advances in Combinatorial Optimization 121
Decision Making under Uncertainty in Electricity Markets 121
An Overview of Advances in Combinatorial Optimization Related Topics 120
Combinatorial optimization: Theory, computation, and applications 119
Combinatorial optimization issues in scheduling 118
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem 115
Developments in combinatorial optimization 115
An Overview of Computational Issues in Combinatorial Optimization 115
4OR: A Quarterly Journal of Operations Research 114
The assignment and loading transportation problem 113
Rejoinder on: Routing problems with loading constraints 112
A look at the past and present of optimization 112
Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems 111
Combinatorics for Modern Manufacturing, Logistics and Supply Chains 110
Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication. 110
Heuristics for the General Multiple Non-linear Knapsack Problem 110
Exact solution techniques for two-dimensional cutting and packing 109
Heuristic and exact algorithms for the interval min–max regret knapsack problem 108
2DPackLib: a two-dimensional cutting and packing library 108
Discrete Applied Mathematics, Mathematical Software Section 107
The quadratic knapsack problem 106
Twelve surveys in operations research 106
GraphsJ 3: A modern didactic application for graph algorithms 105
The quadratic knapsack problem with setup 102
Totale 15.803
Categoria #
all - tutte 51.332
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 51.332


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.104 0 0 0 0 0 95 22 118 135 95 85 554
2021/20223.276 337 102 316 331 337 269 202 286 230 87 328 451
2022/20232.080 261 290 99 217 189 143 78 107 351 41 200 104
2023/20241.047 33 94 43 68 95 213 77 114 35 128 68 79
2024/20253.225 129 324 298 250 805 141 232 108 104 146 140 548
2025/20263.337 447 523 829 503 695 340 0 0 0 0 0 0
Totale 19.247