BELOTTI, PIETRO LUIGI
 Distribuzione geografica
Continente #
NA - Nord America 3.466
EU - Europa 1.923
AS - Asia 1.557
SA - Sud America 385
AF - Africa 141
Continente sconosciuto - Info sul continente non disponibili 117
OC - Oceania 4
Totale 7.593
Nazione #
US - Stati Uniti d'America 3.359
RU - Federazione Russa 827
SG - Singapore 515
IT - Italia 444
CN - Cina 338
VN - Vietnam 328
BR - Brasile 312
MA - Marocco 116
GB - Regno Unito 113
DE - Germania 105
KR - Corea 90
FR - Francia 87
JP - Giappone 72
SE - Svezia 70
UA - Ucraina 64
CA - Canada 55
HK - Hong Kong 46
IE - Irlanda 46
FI - Finlandia 40
BD - Bangladesh 34
NL - Olanda 31
AR - Argentina 27
ID - Indonesia 25
AT - Austria 24
IN - India 22
MX - Messico 17
ES - Italia 14
IQ - Iraq 12
EC - Ecuador 11
PL - Polonia 11
TW - Taiwan 11
BE - Belgio 10
CO - Colombia 10
TR - Turchia 10
JM - Giamaica 9
PH - Filippine 9
GR - Grecia 7
JO - Giordania 7
SA - Arabia Saudita 7
DZ - Algeria 6
PK - Pakistan 6
VE - Venezuela 6
ZA - Sudafrica 6
CR - Costa Rica 5
LT - Lituania 5
SK - Slovacchia (Repubblica Slovacca) 5
UY - Uruguay 5
BO - Bolivia 4
EG - Egitto 4
HN - Honduras 4
MY - Malesia 4
PT - Portogallo 4
PY - Paraguay 4
UZ - Uzbekistan 4
AU - Australia 3
BB - Barbados 3
CL - Cile 3
GT - Guatemala 3
IR - Iran 3
KE - Kenya 3
NI - Nicaragua 3
PE - Perù 3
RO - Romania 3
TN - Tunisia 3
AL - Albania 2
EE - Estonia 2
KZ - Kazakistan 2
PA - Panama 2
QA - Qatar 2
TH - Thailandia 2
TT - Trinidad e Tobago 2
AE - Emirati Arabi Uniti 1
AG - Antigua e Barbuda 1
AZ - Azerbaigian 1
BG - Bulgaria 1
BH - Bahrain 1
BJ - Benin 1
BN - Brunei Darussalam 1
BY - Bielorussia 1
CH - Svizzera 1
CI - Costa d'Avorio 1
CW - ???statistics.table.value.countryCode.CW??? 1
CZ - Repubblica Ceca 1
DO - Repubblica Dominicana 1
GE - Georgia 1
IS - Islanda 1
LB - Libano 1
LK - Sri Lanka 1
LU - Lussemburgo 1
LV - Lettonia 1
MM - Myanmar 1
MQ - Martinica 1
MU - Mauritius 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
PR - Porto Rico 1
RS - Serbia 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 7.478
Città #
Ashburn 511
San Jose 342
Singapore 265
Fairfield 227
Council Bluffs 153
Woodbridge 141
Chandler 137
Moscow 121
Santa Clara 118
Milan 115
Wilmington 106
Houston 91
Seattle 88
Seoul 88
The Dalles 87
Ho Chi Minh City 76
Tokyo 69
Boardman 65
Los Angeles 65
Cambridge 62
Casablanca 61
Beijing 60
London 59
Lauterbourg 55
Lawrence 53
Dong Ket 52
Ann Arbor 51
Hefei 47
Kenitra 47
Dublin 46
Hanoi 44
Jacksonville 42
Rome 42
Medford 40
Hong Kong 34
São Paulo 28
New York 27
Buffalo 25
Dearborn 25
San Diego 25
Ottawa 22
Helsinki 21
North Charleston 21
Phoenix 20
Da Nang 19
Dallas 17
Vienna 17
Washington 17
Jakarta 15
Princeton 14
Columbus 13
Denver 13
Frankfurt am Main 13
Shanghai 13
Chicago 12
Orem 12
Bologna 11
Florence 11
Guangzhou 11
Atlanta 10
Frisco 10
Las Vegas 10
Figino 9
Haiphong 9
Hangzhou 9
Manchester 9
Naples 9
Miano 8
Newark 8
Rio de Janeiro 8
Amman 7
Amsterdam 7
Bari 7
Belo Horizonte 7
Brooklyn 7
Des Moines 7
Dhaka 7
Kingston 7
Shenzhen 7
Taichung 7
Algiers 6
Berlin 6
Bogotá 6
Central 6
Changsha 6
Chennai 6
Kent 6
Miami 6
Porto Alegre 6
Rotterdam 6
Turin 6
Verona 6
Warsaw 6
Baghdad 5
Delfgauw 5
Dortmund 5
Edinburgh 5
Fuzhou 5
Mexico City 5
Montreal 5
Totale 4.364
Nome #
Couenne 279
Lower bounding procedure for the asymmetric quadratic traveling salesman problem 271
A branch-and-cut method for the obnoxious p-median problem 261
A Lagrangian relaxation approach for the design of networks with shared protection 249
Optimal Charging Station Location in a Linear Cycle Path with Deviations 196
Convex hull characterizations of lexicographic orderings 191
Engineering Robust Next-Generation Networks 173
Algorithms for discrete nonlinear optimization in FICO Xpress 171
Multi-layer MPLS network design: The impact of statistical multiplexing 163
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization 160
Design of Multi-Layer Networks with Traffic Grooming and Statistical Multiplexing 157
Randomized relaxation methods for the maximum feasible subsystem problem 152
Branching and bounds tightening techniques for non-convex MINLP 150
Efficient storage of pareto points in biobjective mixed integer programming 148
Optimization of E-bike networks 144
Provisioning Virtual Private Networks under traffic uncertainty 144
Political Districting to Optimize the Polsby-Popper Compactness Score with Application to Voting Rights 141
Provisioning Virtual Private Networks under traffic uncertainty 140
A branch-and-price algorithm for the risk-equity constrained routing problem 140
Spatial branching for a special class of convex MIQO problems 135
QPLIB: a library of quadratic programming instances 133
Disjunctive cuts for nonconvex MINLP 133
MPLS over Transport Netwok: Two Layer Approach to Network Design with Statistical Multiplexing 133
Optimizing base station location and configuration in UMTS networks 132
A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization 131
Convex envelopes of bounded monomials on two-variable cones 130
Disjunctive inequalities: applications and extensions 130
Branch-and-cut techniques for solving realistic two-layer network design problems 124
Quadratic TSP: A lower bounding procedure and a column generation approach 122
Multicommodity Network Design with Discrete Node Costs 119
Feasibility-based bounds tightening via fixed points 119
Bound reduction using pairs of linear inequalities 117
A probing algorithm for MINLP with failure prediction by SVM 112
On the composition of convex envelopes for quadrilinear terms 112
A primal algorithm for the weighted minimum covering ball problem in Rn 111
Optimizing routing and network design with statistical multiplexing 110
A local branching heuristic for MINLPs 110
Multicommodity network design with survivability constraints: some models and algorithms 105
Multicommodity network design under polyhedral demand uncertainty 104
New formulations for the kissing number problem 100
Network design with groming constraints 98
Fathoming rules for biobjective mixed integer linear programs: Review and extensions 95
Mixed-integer nonlinear optimization 95
Robustness in Next Generation Networks 92
Linear programming relaxations of quadratically constrained quadratic programs 90
Linear inequalities for bounded products of variables 90
Multilayer network design: a row-column generation algorithm 87
Three ideas for a feasibility pump for nonconvex MINLP 85
Optimization of catheter position and dwell time in prostate HDR brachytherapy using HIPO and linear programming 81
On families of quadratic surfaces having fixed intersections with two hyperplanes 76
Computing global optimal solutions of the secondary voltage regulation problem 75
Virtual private network design under traffic uncertainty 75
Models for production planning under power interruptions 74
On handling indicator constraints in mixed integer programming 70
Optimal oblivious routing under linear and ellipsoidal uncertainty 66
Valid inequalities and convex hulls for multilinear functions 66
Rounding-based heuristics for nonconvex MINLPs 63
Using branch-and-bound algorithms to optimize selection of a fixed-size breeding population under a relatedness constraint 62
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty 57
Solving MINLPs to global optimality with FICO® Xpress global 54
Optimal Location of E-Bike Chargers on Touristic Cycleway Networks 25
Challenging Slow Mobility Through e-technologies 24
The Future of Slow Mobility: A Review on Design, Planning and Ethical Aspects of E-Bikes 23
Planning Slow Tourism with e-Technologies. A Proposal for Locating e-Bike Charging Stations Along the Italian National System of Tourist Cycling Routes 18
Totale 7.593
Categoria #
all - tutte 24.919
article - articoli 13.733
book - libri 0
conference - conferenze 6.954
curatela - curatele 72
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 3.140
Totale 48.818


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022309 0 0 0 17 55 25 31 19 25 20 48 69
2022/2023321 64 41 29 4 29 34 3 34 51 9 14 9
2023/2024240 11 40 29 12 18 28 19 9 1 24 24 25
2024/2025959 21 16 24 12 140 73 63 102 146 56 154 152
2025/20263.733 606 625 171 396 218 149 476 207 187 339 87 272
2026/2027816 145 108 326 237 0 0 0 0 0 0 0 0
Totale 7.593