CRIS Current Research Information System

MARTELLO, SILVANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.329
EU - Europa 4.472
AS - Asia 2.165
AF - Africa 273
SA - Sud America 43
OC - Oceania 22
Continente sconosciuto - Info sul continente non disponibili 2
Totale 13.306
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.309
GB - Regno Unito 1.307
CN - Cina 771
DE - Germania 685
VN - Vietnam 595
IT - Italia 589
SE - Svezia 424
UA - Ucraina 396
SG - Singapore 309
IN - India 254
FR - Francia 239
RU - Federazione Russa 194
IE - Irlanda 165
ZA - Sudafrica 104
EE - Estonia 91
GR - Grecia 72
CH - Svizzera 69
PL - Polonia 54
JO - Giordania 46
SC - Seychelles 40
NG - Nigeria 34
TG - Togo 34
BG - Bulgaria 31
KR - Corea 30
CI - Costa d'Avorio 29
MY - Malesia 29
JP - Giappone 28
BR - Brasile 26
HK - Hong Kong 25
PH - Filippine 25
FI - Finlandia 22
AU - Australia 21
BE - Belgio 20
AT - Austria 19
CA - Canada 16
NL - Olanda 15
PT - Portogallo 14
TR - Turchia 14
DZ - Algeria 13
HR - Croazia 13
LB - Libano 13
HU - Ungheria 10
IR - Iran 9
MA - Marocco 9
RS - Serbia 8
TN - Tunisia 8
CL - Cile 6
DK - Danimarca 5
ES - Italia 5
RO - Romania 5
AR - Argentina 4
CZ - Repubblica Ceca 4
LU - Lussemburgo 4
MX - Messico 4
EC - Ecuador 3
NO - Norvegia 3
PE - Perù 3
PK - Pakistan 3
TW - Taiwan 3
EG - Egitto 2
EU - Europa 2
LT - Lituania 2
SA - Arabia Saudita 2
SK - Slovacchia (Repubblica Slovacca) 2
AE - Emirati Arabi Uniti 1
BA - Bosnia-Erzegovina 1
BO - Bolivia 1
CY - Cipro 1
ID - Indonesia 1
IL - Israele 1
IS - Islanda 1
LA - Repubblica Popolare Democratica del Laos 1
LI - Liechtenstein 1
MD - Moldavia 1
MN - Mongolia 1
NZ - Nuova Zelanda 1
QA - Qatar 1
SI - Slovenia 1
TH - Thailandia 1
UZ - Uzbekistan 1
Totale 13.306
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.211
Southend 1.154
Fairfield 734
Ashburn 484
Wilmington 382
Woodbridge 370
Chandler 363
Seattle 350
Dong Ket 324
Houston 314
Princeton 277
Jacksonville 274
Cambridge 271
Singapore 249
Dublin 160
Nanjing 135
Westminster 125
Padova 116
Bologna 86
Berlin 83
Saint Petersburg 74
Medford 66
Bern 57
Jinan 57
Mülheim 56
Shenyang 48
San Diego 47
Amman 46
Turin 45
Los Angeles 44
Changsha 43
Santa Clara 41
Beijing 37
Mahé 37
Hebei 35
Lomé 34
Milan 34
Nanchang 33
Sofia 31
Abeokuta 30
Abidjan 29
Des Moines 28
Guangzhou 27
Boardman 26
Rome 26
Jiaxing 24
New York 24
Dearborn 23
Frankfurt am Main 22
Shanghai 22
Tianjin 22
Helsinki 21
Tokyo 21
Brussels 20
Semenyih 19
Leeds 17
San Francisco 17
Verona 17
Haikou 16
Hangzhou 16
Zhengzhou 16
Villiers-sur-marne 15
Chicago 14
Kunming 14
London 14
Vicenza 14
Falls Church 13
Lanzhou 13
Ningbo 13
Olalla 13
Paris 13
San Venanzo 13
Norwalk 12
Fuzhou 11
Redwood City 11
Athens 10
Washington 10
Carmona 9
Karlsruhe 9
Shenzhen 9
Canberra 8
Porto 8
Warsaw 8
Central 7
Forlì 7
Frankfurt Am Main 7
Kuala Lumpur 7
Lubin 7
Rabat 7
Szeged 7
Taizhou 7
Tappahannock 7
Toronto 7
Utrecht 7
Vetapalem 7
Bolechowice 6
Campinas 6
Cologne 6
Groß-Umstadt 6
Hong Kong 6
Totale 9.178
Salva come PNG Salva come JPEG
Nome #
Bin Packing Approximation Algorithms: Survey and Classification. 497
Two-dimensional Bin Packing Problems 207
An optimization problem in the electricity market 185
A case of plagiarism: Danut Marcu 178
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem 169
A Free Educational Java Framework for Graph Algorithms 168
Models and Bounds for Two-Dimensional Level Packing Problems 167
BPPLIB: a library for bin packing and cutting stock problems 166
Combinatorial Traveling Salesman Problem Algorithms 164
An MILP Approach for Short-Term Hydro Scheduling and Unit Commitment With Head-Dependent Reservoir 163
Piecewise linear approximation of functions of two variables in MILP models 163
A Fast and Efficient Algorithm to Exploit Multi-user Diversity in IEEE 802.16 BandAMC 162
Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems 160
The traveling salesman problem with pickups, deliveries, and draft limits 155
Complexity and approximation of an area packing problem 149
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem 148
Training software for orthogonal packing problems 147
Optimal scheduling of a multiunit hydro power station in a short-term planning horizon 146
A brand new cheating attempt: a case of usurped identity 146
Packing into the smallest square: Worst-case analysis of lower bounds 142
4OR: A Quarterly Journal of Operations Research 141
A note on exact algorithms for the identical parallel machine scheduling problem 140
Two-Dimensional Bin Packing Problems 139
Efficient two-dimensional data allocation in IEEE 802.16 OFDMA 139
4OR: A Quarterly Journal of Operations Research 138
Lower bounds and heuristic algorithms for the $k_i$-Partitioning problem 136
4OR: Year 4 134
A tabu search algorithm for a routing and container loading problem 134
A Tabu search heuristic for the Vehicle Routing Problem with two-dimensional loading constraints 129
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem 127
Efficient two-dimensional packing algorithms for mobile WiMAX 127
Plagiarism again: Sreenivas and Srinivas, with an update on Marcu 126
Optimistic MILP modeling of non-linear optimization problems 124
Heuristic algorithms and scatter search for the cardinality constrained PCmax problem 123
null 123
Obituary: Stefano Pallottino 1945-2004 121
Mathematical models and decomposition methods for the multiple knapsack problem 121
Lower and upper bounds for the non-linear generalized assignment problem 121
Tspack: A unified tabu search code for multi-dimensional bin packing problems 120
Nuovi problemi di ottimizzazione per i produttori in un mercato competitivo dell’energia elettrica 119
Models and algorithms for packing rectangles into the smallest square 119
Récentes avancées sur le problème de bin packing à deux dimensions. 116
An aggregate label setting policy for the multi-objective shortest path problem 116
Logic based Benders' decomposition for orthogonal stock cutting problems 113
Nuovi problemi d’ottimizzazione per i produttori in un mercato competitivo dell’energia elettrica 112
Relaxations and heuristics for the multiple non-linear separable knapsack problem 111
Computational advances in combinatorial optimization 110
4OR Quarterly Journal of the Belgian, French and Italian Operations Research Societies 109
Advances in combinatorial optimization 109
Sweet sixteen 108
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem 107
Ricerca Operativa per l’Economia e l’Impresa 106
4OR: A Quarterly Journal of Operations Research 105
Eleven surveys in operations research: II 105
Models and algorithms for fair layout optimization problems 105
Heuristic algorithms for the general nonlinear separable knapsack problems, 105
Combinatorial optimization: theory, computation, and applications 104
No 7-year itch at 4OR 103
Assignment Problems - Revised Reprint 102
An annotated bibliography of combined routing and loading problems 101
An iterated dual substitution approach for the min-max regret multidimensional knapsack problem 99
Ricerca Operativa per la Laurea Magistrale 98
An Overview of Advances in Combinatorial Optimization Related Topics 98
Advances in Combinatorial Optimization 97
4OR: A Quarterly Journal of Operations Research 96
4OR: A Quarterly Journal of Operations Research 96
Linear programming approach for the transition from market-generated hourly energy programs to feasible power generation schedules 96
Combinatorial optimization issues in scheduling 94
Bin packing and cutting stock problems: Mathematical models and exact algorithms 94
Algorithms for the min-max regret generalized assignment problem with interval data 93
The dirty dozen of 4OR 93
4OR: A Quarterly Journal of Operations Research 92
Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems 92
Routing problems with loading constraints 92
Combinatorial optimization: Theory, computation, and applications 92
Surveys in operations research 92
An Overview of Computational Issues in Combinatorial Optimization 91
Decision Making under Uncertainty in Electricity Markets 90
Heuristics for the General Multiple Non-linear Knapsack Problem 88
Rejoinder on: Routing problems with loading constraints 87
Computational Advances in Combinatorial Optimization 87
Combinatorics for Modern Manufacturing, Logistics and Supply Chains 85
4OR: A Quarterly Journal of Operations Research 85
Eleven Surveys in Operations Research 84
Twelve surveys in operations research 84
A look at the past and present of optimization 84
Logistics: From theory to application (ECCO XIV) 82
Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication. 82
Developments in combinatorial optimization 81
Heuristic and exact algorithms for the interval min–max regret knapsack problem 80
Preface 76
Optimal design of fair layouts 76
Eleven surveys in operations research: III 74
Discrete Applied Mathematics, Mathematical Software Section 72
Ricerca Operativa 69
Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications 69
Assignment Problems 69
GraphsJ 3: A modern didactic application for graph algorithms 69
Feature Issue: Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications (ECCO XV) 67
Feature Issue: Combinatorics for Modern Manufacturing, Logistics and Supply Chain 64
Totale 11.739
Salva come PNG Salva come JPEG
Categoria #
all - tutte 33.137
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 33.137
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.643 0 0 0 188 297 379 397 442 400 265 83 192
2020/20211.747 384 120 41 74 24 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/2025875 129 324 298 124 0 0 0 0 0 0 0 0
Totale 13.560