GAUDIOSO, Manlio
 Distribuzione geografica
Continente #
NA - Nord America 4.325
AS - Asia 3.767
EU - Europa 2.415
SA - Sud America 902
AF - Africa 296
OC - Oceania 17
Continente sconosciuto - Info sul continente non disponibili 6
Totale 11.728
Nazione #
US - Stati Uniti d'America 4.109
SG - Singapore 1.530
CN - Cina 730
UA - Ucraina 727
BR - Brasile 641
VN - Vietnam 579
DE - Germania 472
IT - Italia 372
HK - Hong Kong 178
SE - Svezia 171
FR - Francia 165
SN - Senegal 163
AT - Austria 156
TR - Turchia 134
CA - Canada 127
KR - Corea 104
AR - Argentina 102
BD - Bangladesh 85
IN - India 85
GB - Regno Unito 79
IQ - Iraq 66
RU - Federazione Russa 62
FI - Finlandia 57
PK - Pakistan 44
MX - Messico 43
ZA - Sudafrica 38
CO - Colombia 37
EC - Ecuador 36
ID - Indonesia 28
MA - Marocco 28
BE - Belgio 26
CL - Cile 23
NL - Olanda 23
VE - Venezuela 23
UZ - Uzbekistan 21
CZ - Repubblica Ceca 19
MY - Malesia 19
SA - Arabia Saudita 18
JO - Giordania 17
PY - Paraguay 16
EG - Egitto 15
AU - Australia 14
ES - Italia 14
AZ - Azerbaigian 13
PL - Polonia 13
DZ - Algeria 12
JP - Giappone 11
PH - Filippine 11
TN - Tunisia 11
IL - Israele 10
KE - Kenya 10
UY - Uruguay 10
HN - Honduras 9
CR - Costa Rica 8
KZ - Kazakistan 8
NP - Nepal 8
AE - Emirati Arabi Uniti 7
KH - Cambogia 7
AL - Albania 6
BO - Bolivia 6
DO - Repubblica Dominicana 6
ET - Etiopia 6
IR - Iran 6
LT - Lituania 6
OM - Oman 6
PA - Panama 6
SK - Slovacchia (Repubblica Slovacca) 6
SY - Repubblica araba siriana 6
EU - Europa 5
NI - Nicaragua 5
PS - Palestinian Territory 5
PT - Portogallo 5
RO - Romania 5
TW - Taiwan 5
BG - Bulgaria 4
BY - Bielorussia 4
CH - Svizzera 4
GT - Guatemala 4
JM - Giamaica 4
KG - Kirghizistan 4
PE - Perù 4
TH - Thailandia 4
BH - Bahrain 3
CI - Costa d'Avorio 3
CY - Cipro 3
GE - Georgia 3
GR - Grecia 3
LB - Libano 3
SI - Slovenia 3
TT - Trinidad e Tobago 3
BA - Bosnia-Erzegovina 2
HU - Ungheria 2
IE - Irlanda 2
NG - Nigeria 2
NZ - Nuova Zelanda 2
RS - Serbia 2
SR - Suriname 2
TG - Togo 2
AO - Angola 1
BF - Burkina Faso 1
Totale 11.708
Città #
Singapore 657
Chandler 567
Jacksonville 471
San Jose 310
Ashburn 289
Dearborn 246
Ho Chi Minh City 228
Boardman 226
San Mateo 197
Dallas 187
Hong Kong 175
Beijing 171
Dakar 161
Vienna 119
Hanoi 117
Seoul 102
Lawrence 101
Roxbury 101
Ottawa 96
Shanghai 95
Lauterbourg 94
Izmir 93
Ann Arbor 86
Des Moines 73
Hefei 69
Munich 69
Los Angeles 59
Inglewood 57
Brooklyn 52
São Paulo 49
Florence 48
Rende 46
Helsinki 42
New York 40
Council Bluffs 39
Cambridge 31
Bremen 30
Ogden 30
Wilmington 29
Brussels 26
Da Nang 26
Afragola 24
San Francisco 24
The Dalles 24
Haiphong 23
Orem 23
Islamabad 21
Rio de Janeiro 21
Baghdad 20
Dhaka 20
Guangzhou 20
Tashkent 20
Columbus 19
Seattle 19
Frankfurt am Main 18
Pune 18
Santa Clara 18
Brno 17
Johannesburg 17
Catanzaro 16
Amman 15
Biên Hòa 15
Erbil 15
Toronto 15
Quito 14
Tianjin 14
Kocaeli 13
Nanjing 13
Rome 13
Shenzhen 13
Turku 13
Campinas 12
Can Tho 12
Chennai 12
London 12
Asunción 11
Atlanta 11
Kuala Lumpur 11
Manchester 11
Medellín 11
Tokyo 11
Warsaw 11
Bogotá 10
Grafing 10
Jiaxing 10
Palermo 10
Redwood City 10
Riyadh 10
Bari 9
Belo Horizonte 9
Buenos Aires 9
Cape Town 9
Castrolibero 9
Hải Dương 9
Milan 9
Nairobi 9
Amsterdam 8
Baku 8
Bắc Ninh 8
Cotia 8
Totale 6.528
Nome #
An incremental method for solving convex finite min-max problems 189
A Lagrangean-based decomposition approach for the link constrained Steiner tree problem** 189
A Lagrangian relaxation approach for binary Multiple Instance Classification 184
Minimizing piecewise-concave functions over polyhedra 179
Multiple instance learning algorithm for medical image classification 170
A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization 168
Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations 166
Classification in the multiple instance learning framework via spherical separation 166
A Multiple Instance Learning Algorithm for Color Images Classification 164
An algorithm to find the link constrained steiner tree in undirected graphs 163
A Decomposition-Based Heuristic for the Truck-Scheduling Problem in a Cross-Docking Terminal 158
Essentials of numerical nonsmooth optimization 153
A heuristic for the periodic vehicle routing problem 152
Essentials of numerical nonsmooth optimization 151
A new solution approach to the truck scheduling problem in distribution centres 148
A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time 148
DC models for spherical separation 147
Minimizing nonconvex nonsmooth functions via cutting planes and proximity control 146
A partially inexact bundle method for convex semi-infinite minmax problems 144
A bundle type approach to the unconstrained minimization of convex nonsmooth functions 143
A multiplier adjustment technique for capacitated concentrator location problem 143
On the single door cross-docking problem 142
Lagrangian relaxation for the directional sensor coverage problem with continuous orientation 141
A Branch-and-Cut Algorithm for the Quay Crane Scheduling Problem in a Container Terminal 139
Margin maximization in spherical separation 136
A fixed-center spherical separation algorithm with kernel 134
Fair workload assignment to subcontractor companies at a container terminal 134
A Lagrangian approach to a cross-docking problem with multiple gates 133
Linear programming models for load balancing 131
On solving the Lagrangian dual of integer programs via an incremental approach 130
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem 129
A savings-based model for two-shipper cooperative routing 128
A class of manpower scheduling problems 127
A DC optimization-based clustering technique for edge detection 126
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks 126
OPTIMISED TOOL-PATH DESIGN TO REDUCE THINNING IN ISF PROCESS 123
A multiplier adjustment technique for the capacitated concentrator location problem 122
A heuristic approach for multiple instance learning by linear separation 121
Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems 118
A method for convex minimization based on translated first order approximations 118
Fixed and virtual stability center methods for convex nonsmooth minimization 118
The service allocation problem at the Giola Tauro Maritime Terminal 118
Data preprocessing in semi-supervised SVM classification 117
A Memetic Heuristic for the Generalized Quadratic Assignment Problem 113
A splitting bundle approach for non-smooth non-convex minimization 112
Truck synchronization at single door cross-docking terminals 112
Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization 111
Nonlinear Programming for Classification Problems in Machine Learning 109
Robust spherical separation 107
Piecewise linear approximations in nonconvex nonsmooth optimization 107
Gas Detection via Machine Learning 105
Lower and Upper Bounds for the Spanning Tree with Minimum Branch Vertices 104
Ottimizzazione e simulazione nella gestione di un terminal container portuale: il caso di Gioia Tauro 103
Management of periodic demands in distribution systems 103
Lagrangian relaxation for SVM feature selection 102
Repulsive assignment problem 100
Conic separation of finite sets. I. The homogeneous case 100
Dual formulation of the sparsity constrained optimization problem: application to classification 99
Analysis of regularization techniques in convex nondifferentiable optimization 96
Polyhedral separability through successive LP 95
Gas Detection via Machine Learning 95
Numerical infinitesimals in a variable metric method for convex nonsmooth optimization 92
Piecewise affine models for minimizing nonconvex nonsmooth functions 92
Quadratic approximations in convex nondifferentiable optimization 92
Stopping criteria for line searches without derivatives 91
Edge detection by spherical separation 90
An illumination problem with tradeoff between coverage of a dataset and aperture angle of a conic light beam 90
The Grossone-Based Diagonal Bundle Method 87
On numerical solving the spherical separability problem 87
SCHEDULING OF PERIODIC REQUESTS FOR COMMODITIES OR SERVICES 87
Optimal replenishment order placement in a finite time horizon 87
Some techniques for finding the search direction in nonsmooth minimization problems 87
Least Square Regression Method for Estimating Gas Concentration in an Electronic Nose System 87
Un metodo numerico per la minimizzazione di funzioni non differenziabili 86
An appoach to classification based on separation of sets by means of several ellipsoids 85
Optimization problems in the operational management of a container terminal 84
Optimizing Sensor Cover Energy for Directional Sensors 84
The Newton direction and the cutting plane 84
The Descent–Ascent Algorithm for DC Programming 83
Variants to the cutting plane approach for convex nondifferentiable optimization 81
Piecewise quadratic approximations in convex numerical optimization. 81
Management of concurrent operations in two container vessels 80
Tuning strategy for the proximity parameter in convex minimization 80
OMEGA One Multi Ethnic Genetic Approach 80
Conic separation of finite sets. II: The nonhomogeneous case 80
Difference of Convex programming in adversarial SVM 79
The cobweb method for minimizing convex functions 79
On the Use of the SVM Approach in Analyzing an Electronic Nose 79
Optimal management of the equipment maintenance at a container terminal 79
Optimised tool-path design to reduce thinning in incremental sheet forming process 79
The Repulsive Assignment Problem 78
Ellipsoidal separation for classification problems 78
Parametric fractional programming via inexact maximization 78
Malicious URL detection via spherical classification 78
SVM classification in the design of an electronic nose 76
Separation of Finitely Many Convex Sets and Data Pre-classification 75
Central axes and peripheral points in high dimensional directional datasets 73
An illumination problem: optimal apex and optimal orientation for a cone of light 73
Optimal Secure and Economical Dispatching by means of a min-max-min optimization technique 72
Gradient set splitting in nonconvex nonsmooth numerical optimization 72
Totale 11.260
Categoria #
all - tutte 68.117
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 68.117


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202184 0 0 0 0 0 0 0 0 0 0 0 84
2021/20221.069 10 148 7 60 107 13 8 230 6 16 195 269
2022/20231.322 164 143 43 198 159 131 2 198 147 23 75 39
2023/2024837 63 27 67 19 55 160 28 83 54 66 48 167
2024/20251.767 94 268 39 87 161 72 57 113 265 53 170 388
2025/20264.627 623 228 300 396 1.053 367 558 215 316 412 138 21
Totale 11.845