CNR Institutional Research Information System

GENTILE, CLAUDIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 2.784
NA - Nord America 1.742
SA - Sud America 554
EU - Europa 534
AF - Africa 59
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 1
Totale 5.682
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.698
SG - Singapore 1.103
CN - Cina 711
BR - Brasile 461
VN - Vietnam 286
HK - Hong Kong 248
KR - Corea 153
FR - Francia 145
IT - Italia 115
NL - Olanda 85
JP - Giappone 74
IN - India 49
AR - Argentina 33
DE - Germania 33
BD - Bangladesh 25
GB - Regno Unito 25
IL - Israele 24
FI - Finlandia 17
ID - Indonesia 17
CA - Canada 15
PL - Polonia 15
TR - Turchia 15
ZA - Sudafrica 15
AT - Austria 14
EC - Ecuador 13
MX - Messico 13
PK - Pakistan 13
MA - Marocco 12
RU - Federazione Russa 12
PY - Paraguay 11
ES - Italia 10
IQ - Iraq 10
UA - Ucraina 10
UZ - Uzbekistan 10
BE - Belgio 9
AU - Australia 8
CL - Cile 8
PE - Perù 8
KE - Kenya 7
AL - Albania 6
CO - Colombia 6
EG - Egitto 6
SA - Arabia Saudita 6
CZ - Repubblica Ceca 5
DZ - Algeria 5
KZ - Kazakistan 5
TN - Tunisia 5
TW - Taiwan 5
UY - Uruguay 5
BO - Bolivia 4
DO - Repubblica Dominicana 4
EE - Estonia 4
GR - Grecia 4
HN - Honduras 4
VE - Venezuela 4
AE - Emirati Arabi Uniti 3
CI - Costa d'Avorio 3
CR - Costa Rica 3
HU - Ungheria 3
IR - Iran 3
JO - Giordania 3
MY - Malesia 3
RO - Romania 3
SE - Svezia 3
AM - Armenia 2
AZ - Azerbaigian 2
BG - Bulgaria 2
IE - Irlanda 2
KH - Cambogia 2
KW - Kuwait 2
LT - Lituania 2
MD - Moldavia 2
NI - Nicaragua 2
NO - Norvegia 2
PH - Filippine 2
SN - Senegal 2
TH - Thailandia 2
AF - Afghanistan, Repubblica islamica di 1
BA - Bosnia-Erzegovina 1
BN - Brunei Darussalam 1
BW - Botswana 1
BY - Bielorussia 1
CH - Svizzera 1
CY - Cipro 1
GE - Georgia 1
GH - Ghana 1
KN - Saint Kitts e Nevis 1
LV - Lettonia 1
MN - Mongolia 1
MR - Mauritania 1
MW - Malawi 1
OM - Oman 1
PT - Portogallo 1
SI - Slovenia 1
SR - Suriname 1
SV - El Salvador 1
TT - Trinidad e Tobago 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 5.682
Salva come PNG Salva come JPEG
Città #
Santa Clara 1.014
Singapore 700
Hefei 334
Hong Kong 240
Seoul 152
San Jose 124
Lauterbourg 118
Beijing 107
Ho Chi Minh City 102
Ashburn 72
Hanoi 67
Los Angeles 64
Rome 56
Tokyo 51
Dallas 46
São Paulo 40
New York 27
Minamishinagawa 20
Orem 19
Haiphong 18
Da Nang 16
Helsinki 15
Bengaluru 14
Buffalo 13
Frankfurt am Main 11
Nuremberg 11
Johannesburg 10
Milan 10
Salvador 10
Warsaw 10
Rio de Janeiro 9
Tashkent 9
Biên Hòa 8
Chennai 8
Council Bluffs 7
Dhaka 7
Lahore 7
Ribeirão Preto 7
Shanghai 7
Thái Bình 7
Curitiba 6
Denver 6
Vienna 6
Amsterdam 5
Belo Horizonte 5
Brussels 5
Caxias do Sul 5
Florianópolis 5
Fortaleza 5
Istanbul 5
Munich 5
Phoenix 5
Quito 5
Ankara 4
Asunción 4
Baghdad 4
Brasília 4
Campo Grande 4
Carapicuíba 4
Casablanca 4
Cropani 4
Foz do Iguaçu 4
Guarulhos 4
Guayaquil 4
Jeddah 4
Juiz de Fora 4
Manchester 4
Montevideo 4
Nairobi 4
New Delhi 4
Pelotas 4
Porto Alegre 4
Prague 4
Quận Một 4
Recife 4
Rio Claro 4
Santiago 4
Thái Nguyên 4
Uberlândia 4
Abidjan 3
Americana 3
Amman 3
Anápolis 3
Bogotá 3
Brooklyn 3
Bình Dương 3
Can Tho 3
Cascina 3
Changsha 3
Charlotte 3
Chittagong 3
City of London 3
Durban 3
Elk Grove Village 3
Guangzhou 3
Hải Dương 3
Itaquaquecetuba 3
Katueté 3
Lima 3
London 3
Totale 3.802
Salva come PNG Salva come JPEG
Nome #
Start-Up/Shut-Down MINLP Formulations for the Unit Commitment with ramp constraints 120
Comparing Formulations for Piecewise Convex Problems 95
Preface: 18th Cologne–Twente Workshop on graphs and combinatorial optimization (CTW 2020) 94
Mathematical programming formulations for the alternating current optimal power flow problem 87
Lagrangian Methods and Dynamic Programming-Based MIP Formulations for the Unit Commitment Problem 80
Approximated Perspective Relaxations: a Project&Lift Approach 79
A heuristic for max-cut in toroidal grid graphs 77
Mod-2 cuts generation yields the convex hull of bounded integer feasible sets 76
New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints 75
Optimal Network Design for Municipal Waste Management: Application to the Metropolitan City of Rome 71
Mod-2 cuts generate the convex hull of bounded feasible integer sets 70
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect 70
The stable set polytope of claw-free graphs with large stability number 69
An optimization framework for ground staff roster management using integer programming 68
Solving Network Problems with Interior Point Methods and Preconditioned Conjugated Gradient Method 67
Comparing perspective reformulations for piecewise-convex optimization 66
A Computational Comparison of Reformulations of the Perspective Relaxation: SOCP vs. Cutting Planes 65
Projected Perspective Reformulations for NonLinear Network Design Problems 60
A computational comparison of SOCP and linear formulations for the convex envelope of some functions arising in Mixed-Integer NonLinear Programming 60
Graphs and Combinatorial Optimization: from Theory to Applications CTW2020 Proceedings Preface 57
New MIP Formulations for the Single-Unit Commitment Problems with Ramping Constraints 57
A counterexample to an exact extended formulation for the single-unit commitment problem 55
A New Mathematical Optimization-Based Method for the m-invariance Problem 54
Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs 54
An algorithm for the microaggregation problem using column generation 54
Perspective cuts for 0-1 Mixed Integer Programming Problems 53
Gear Composition of stable set polytopes and G-perfection 53
Formulations for piecewise-convex problems 52
Price of robustness optimization through demand forecasting with an application to waste management 52
New heuristics for the Max-Cut problem 51
Identify peak events from mobile phone presence data 50
Start-up/Shut-down MINLP Formulations for the Unit Commitment with Ramp Constraints 50
Improving the Approximated Projected Perspective Reformulation by dual information 49
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect 49
Projected Perspective Reformulations with Applications 48
Comparing perspective reformulations for piecewise-convex optimization 48
2-clique-bond of stable set polyhedra 47
New MI-SOCP formulations for the Unit Commitment problems with ramping constraints 47
The k-gear composition and the stable set polytope 47
Mathematical programming formulations for the alternating current optimal power flow problem 47
DP-based formulations of the Unit Commitment Problem and the Convex Hull of Star-Shaped MINLPs 47
An Optimization-Based Decomposition Heuristic for the Microaggregation Problem 45
The stable set polytope of icosahedral graphs 44
Robust Optimal Planning of Waste Sorting Operations 44
The stable set polytope of claw-free graphs with stability number greater than 3 44
The stable set polytope of claw-free graphs with stability number greater than three 44
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect 44
Perspective Reformulations-based Strengthening for the Sequential Convex MINLP Technique 42
The stable set polytope of almost all claw free graphs 41
The stable set polytope of (almost) all claw-free graphs 41
Subgraph-based preconditioners for interior-point approaches to network flow problems 40
2-clique-bond of stable set polyhedra 40
Solving Nonlinear Single-Unit Commitment problems with ramping constraints 39
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect 39
Tight MIP formulations of the power-based unit commitment problem 38
The stable set polytope of claw-free graphs II: XX-graphs are G-perfect 38
Metodi statistici per il riconoscimento di grandi eventi basato su dati di presenza 37
G-perfect graphs 36
Un approccio integrato per l'ottimizzazione della distribuzione di prodotti petroliferi greggi via mare 36
Strengthening the sequential convex MINLP technique by perspective reformulations 36
ADONET Algorithmic Discrete Optimization Network 36
An algorithm for the Microaggregation problem using Column Generation 35
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs 34
Projected Perspective Reformulations with Applications in Design Problems 34
A Primal Approach to the Solution of the Stable Set Problem 34
Mod-2 cuts generate the convex hull of bounded linear feasible integer sets 33
Gear Composition and the Stable Set Polytope 33
An integral LP relaxation for a drayage problem 33
Problemi strutturati a blocchi con variabili intere 33
Perspective cuts for 0-1 Mixed Integer Programming Problems 32
An algorithm for computing lower bounds for the Microaggregation problem 32
A Polyhedral Approach for the Staff Rostering Problem 32
On the way to perfection: {P}rimal Operations for Stable Sets in Graphs 32
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP 32
Strengthening the Sequential Convex MINLP Technique by Perspective Reformulations 32
ADONET Algorithmic Discrete Optimization Network 32
Sequential Lagrangian-MILP Approaches for Unit Commitment Problems 31
A Computational Comparison of Reformulations of the Perspective Relaxation: SOCP vs. Cutting Planes 31
An application of the orienteering problem with time windows for scheduling visits during social events 31
Perspective Reformulations of the CTA Problem with L2 Distances 31
On the Way to Perfection: Primal Operations for Stable Sets in Graphs 31
The stable set polytope of {antihat, claw}-free graphs 31
Gear composition of stable set polytopes and G-perfection 31
Gear composition and the Stable Set Polytope 31
Perspective cuts for a class of convex 0-1 mixed integer programs 30
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs 30
A Primal Approach to the Stable Set Problem 30
On the stable set polytope of claw-free graphs 30
Mod-2 cuts generation yelds the convex hull of bounded integer feasible sets 30
Gear Composition and the Stable Set Polytope 30
Hybrid lagrangian-MILP approaches for unit commitment problems 30
Experiments with a hybrid Interior Point/Combinatorial Approach for Network Flow Problems 30
ADONET Algorithmic Discrete Optimization Network 30
Tighter Approximated MILP Formulations for Unit Commitment Problems 30
Prim-based support-graph preconditioners for Min-Cost Flow Problems 29
Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets 29
ADONET Algorithmic Discrete Optimization Network 29
A dynamic programming approach for single-unit commitment problems with ramping constraints 29
A Polyhedral Approach for the Staff Rostering Problem 28
Mod-2 cuts generation yields the convex hull of bounded integer feasible sets 28
Totale 4.587
Salva come PNG Salva come JPEG
Categoria #
all - tutte 16.835
article - articoli 5.527
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 589
Totale 22.951
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2023/202429 0 0 0 0 0 0 0 0 1 1 24 3
2024/20252.617 4 8 157 139 912 175 50 54 43 100 544 431
2025/20263.110 182 424 315 467 540 162 483 153 183 142 59 0
Totale 5.756