CINECA IRIS Institutional Research Information System

FRANGIONI, ANTONIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 13.428
EU - Europa 3.701
AS - Asia 1.576
AF - Africa 95
SA - Sud America 68
Continente sconosciuto - Info sul continente non disponibili 11
OC - Oceania 10
Totale 18.889
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 8.576
CA - Canada 4.849
IT - Italia 1.370
CN - Cina 790
SE - Svezia 724
DE - Germania 416
BG - Bulgaria 334
SG - Singapore 298
GB - Regno Unito 235
TR - Turchia 181
VN - Vietnam 169
UA - Ucraina 145
FI - Finlandia 97
CH - Svizzera 85
HK - Hong Kong 78
CI - Costa d'Avorio 56
RU - Federazione Russa 55
BR - Brasile 54
BE - Belgio 50
FR - Francia 38
AT - Austria 33
IE - Irlanda 31
NL - Olanda 27
GR - Grecia 26
SN - Senegal 21
IN - India 14
ES - Italia 11
AU - Australia 9
EU - Europa 7
IR - Iran 7
KR - Corea 7
RO - Romania 7
CL - Cile 6
ID - Indonesia 6
JP - Giappone 6
NG - Nigeria 5
PK - Pakistan 5
TW - Taiwan 5
A1 - Anonimo 4
BJ - Benin 4
MU - Mauritius 4
PL - Polonia 4
HU - Ungheria 3
AR - Argentina 2
CO - Colombia 2
CZ - Repubblica Ceca 2
EG - Egitto 2
IL - Israele 2
MX - Messico 2
MY - Malesia 2
PE - Perù 2
SC - Seychelles 2
AE - Emirati Arabi Uniti 1
AI - Anguilla 1
BA - Bosnia-Erzegovina 1
BD - Bangladesh 1
BO - Bolivia 1
DK - Danimarca 1
EE - Estonia 1
IQ - Iraq 1
JO - Giordania 1
KW - Kuwait 1
LT - Lituania 1
LU - Lussemburgo 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
PT - Portogallo 1
PY - Paraguay 1
SK - Slovacchia (Repubblica Slovacca) 1
TH - Thailandia 1
ZA - Sudafrica 1
Totale 18.889
Salva come PNG Salva come JPEG
Città #
Montreal 4.626
Woodbridge 1.177
Fairfield 931
Ann Arbor 920
Houston 871
Ashburn 614
Santa Clara 520
Chandler 451
Milan 423
Seattle 376
Sofia 332
Cambridge 304
Wilmington 295
Serra 263
Jacksonville 221
Ottawa 185
Boardman 173
New York 168
Singapore 157
Beijing 155
Princeton 150
Izmir 127
Nanjing 126
Lawrence 114
Frankfurt am Main 108
Medford 98
Florence 95
Dong Ket 80
Des Moines 73
Lancaster 73
Bern 69
Shanghai 61
Abidjan 56
San Diego 52
Brussels 50
Istanbul 49
Hong Kong 46
London 46
Washington 46
Pisa 45
Jüchen 44
Chicago 43
Dearborn 39
Guangzhou 38
Bondeno 36
Rome 36
Nanchang 32
Redwood City 32
Falls Church 30
Los Angeles 27
Fuzhou 25
Vienna 22
Boulder 21
Dakar 21
Kunming 21
Hebei 19
San Jose 19
Hangzhou 18
Karlsruhe 18
Jinan 17
Phoenix 17
Crespellano 16
Ogden 16
Shenyang 16
Shenzhen 16
Tianjin 16
Quanzhou 15
Wuhan 15
Alessandria 13
Dublin 13
Montréal 13
Changsha 12
Chengdu 12
Helsinki 12
Sacile 12
Boydton 11
Norwalk 11
Pistoia 11
West Jordan 11
Auburn Hills 10
Council Bluffs 10
Munich 10
Ciampino 9
Dallas 9
Hefei 9
Orange 9
Nuremberg 8
Viareggio 8
Indiana 7
Pittsburgh 7
Tappahannock 7
Aachen 6
Belo Horizonte 6
Cagliari 6
Düsseldorf 6
Jiaxing 6
North Bergen 6
Philadelphia 6
Zhengzhou 6
Bologna 5
Totale 15.698
Salva come PNG Salva come JPEG
Nome #
0-1 Reformulations of the Multicommodity Capacitated Network Design Problem 2.735
0-1 Reformulations of the Network Loading Problem 2.688
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G 263
A set-covering formulation for a drayage problem with single and double container loads 195
Beyond canonical DC-Optimization: the single reverse polar problem 184
Perspective cuts for a class of convex 0–1 mixed integer programs 173
Bicriteria Data Compression 172
Minimizing power consumption in virtualized cellular networks 171
Optimal joint path computation and rate allocation for real-time traffic 170
Experiments with Hybrid Interior Point/Combinatorial Approaches for Network Flow Problems 168
Solving nonlinear single-unit commitment problems with ramping constraints 167
A testbed for flexible and energy-efficient resource management with virtualized LTE-A nodes 167
Convergence Analysis of Deflected Conditional Approximate Subgradient Methods 164
Sistema per il Ripristino e la Riprogrammazione in Tempo Reale di Servizi Relativi al Trasporto Pubblico a Seguito di Anomalie" ("A System for Recovery and Real-Time Re-programming of Public Transport Services Ensuing From Anomalies") 164
Computational Evaluation of Multi-Iterative Approaches for Solving Graph-Structured Large Linear Systems 162
A Nonmonotone Proximal Bundle Method With (Potentially) Continuous Step Decisions 161
SDP Diagonalizations and Perspective Cuts for a Class of Nonseparable MIQP 159
Prim-based Support-Graph Preconditioners for Min-Cost Flow Problems 157
On the Choice of Explicit Stabilizing Terms in Column Generation 157
New approaches for optimizing over the semimetric polytope 156
A Computational Comparison of Reformulations of the Perspective Relaxation: SOCP vs. Cutting Planes 155
Large-scale Unit Commitment under uncertainty 154
Accelerated Multigrid for Graph Laplacian Operators 154
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs 152
Primary and Backup Paths Optimal Design for Traffic Engineering in Hybrid IGP/MPLS Networks 149
Piecewise Quadratic Approximations in Convex Numerical Optimization 148
Delay-constrained Routing Problems: Accurate Scheduling Models and Admission Control 148
A Library for Continuous Convex Separable Quadratic Knapsack Problems 147
Scalability and energy efficiency of Coordinated Scheduling in cellular networks towards 5G 147
A Computational Study of Cost Reoptimization for Min Cost Flow Problems 145
Flexible dynamic Coordinated Scheduling in Virtual-RAN deployments 145
On a New Class of Bilevel Programming Problems and its Use For Reformulating Mixed Integer Problems 144
A Stabilized Structured Dantzig-Wolfe Decomposition Method 144
QoS Routing with worst-case delay constraints: models, algorithms and performance analysis 144
Bicriteria data compression 143
Delay-constrained shortest paths: approximation algorithms and second-order cone models 142
Generalized Bundle Methods 138
Statistically Sound Experiments with OpenAirInterface Cloud-RAN Prototypes 137
Lagrangian Heuristics Based on Disaggregated Bundle Methods for Hydrothermal Unit Commitment 136
About Lagrangian Methods in Integer Optimization 136
Approximate optimality conditions and stopping criteria in canonical DC programming 136
Incremental bundle methods using upper models 136
Tighter Approximated MILP Formulations for Unit Commitment Problems 135
On the Computational Efficiency of Subgradient Methods: a Case Study with Lagrangian Bounds 133
Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multi-Commodity Flow Problems 132
Generalized Bundle Methods for Sum-Functions with "Easy" Components: Applications to Multicommodity Network Design 131
New Preconditioners for KKT Systems of Network Flow Problems 130
Large-scale Unit Commitment Under Uncertainty: an Updated Literature Survey 130
Towards Robust Admission Control in Delay-Constrained Routing Problems 130
Solving Semidefinite Quadratic Problems Within Nonsmooth Optimization Algorithms 129
Searching the Best (Formulation, Solver, Configuration) for Structured Problems 129
A Price-and-Branch Algorithm for a Drayage Problem with Heterogeneous Trucks 129
Comparing Spatial and Scenario Decomposition for Stochastic Hydrothermal Unit Commitment Problems 127
A Storm of Feasibility Pumps for Nonconvex MINLP 127
Outer Approximation Algorithms for Canonical Reverse-Polar Problems 125
A Bundle Type Dual-ascent Approach to Linear Multicommodity Min Cost Flow Problems 125
A matheuristic for integrated timetabling and vehicle scheduling 125
Static and Dynamic Routing Under Disjoint Dominant Extreme Demands 123
Spectral Analysis of (Sequences of) Graph Matrices 121
A Multi-exchange Neighborhood for Minimum Makespan Machine Scheduling Problems 121
Appunti di Ricerca Operativa 120
Optimizing over Semimetric Polytopes 119
Special issue on “Convex Analysis, Optimization and Applications” 119
Experiments with a Feasibility Pump Approach for Non-Convex MINLPs 118
Projected Perspective Reformulations with Applications in Design Problems 117
Strengthening the Sequential Convex MINLP Technique by Perspective Reformulations 117
Appunti di Ricerca Operativa 115
Outer Approximation Algorithms for Canonical DC Problems 115
Inexact Stabilized Benders' Decomposition Approaches, with Application to Chance-Constrained Problems with Finite Support 114
Improving the Approximated Projected Perspective Reformulation by Dual Information 114
Transforming Mathematical Models Using Declarative Reformulation Rules 113
Lagrangian Relaxation and Tabu Search Approaches for the Unit Commitment Problem 113
Multicommodity Capacitated Network Design 109
On Interval-subgradient and No-good Cuts 108
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows 107
Using of a cost-based Unit Commitment algorithm to assist bidding strategy decisions 107
Dynamic Smoothness Parameter for Fast Gradient Methods 107
QPLIB: A Library of Quadratic Programming Instances 107
New Lagrangian Heuristics for Ramp-Constrained Unit Commitment Problems 105
Chance Constrained Network Design 103
PaTre: a method for Paralogy Trees Construction 101
Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy 100
Solving Unit Commitment Problems with General Ramp Contraints 99
A Tool for Practical Integrated Time-Table Design and Vehicle Scheduling in Public Transport Systems 99
Applying Bundle Methods to Optimization of Polyhedral Functions: An Applications-Oriented Development 98
Genomic information and biological evolution: some results on genes families 95
A Lagrangian approach to Chance Constrained Routing with Local Broadcast 95
Mathematical Optimization for Efficient and Robust Energy Networks 94
PaTre: A METHOD FOR PARALOGY TREE CONSTRUCTION 92
Linear Programming Models for Traffic Engineering in 100% Survivable Networks under combined IS-IS/OSPF and MPLS-TE Protocols 91
Proceedings of INOC 2009 90
NUOVI PROBLEMI DI OTTIMIZZAZIONE PER I PRODUTTORI IN UN MERCATO COMPETITIVO DELL’ENERGIA ELETTRICA 88
null 86
Approximated Perspective Relaxations: a Project&Lift Approach 86
null 83
Perspective Reformulations of the CTA Problem with L_2 Distances 82
Special issue of EURO Journal on Computational Optimization on "Nonlinear and Combinatorial Methods for Energy Optimization" 81
A MILP Approach to DRAM Access Worst-Case Analysis 81
Projected Perspective Reformulations for NonLinear Network Design Problems 80
Fast lower bounds for the capacitated minimum spanning tree problem 80
Totale 18.063
Salva come PNG Salva come JPEG
Categoria #
all - tutte 42.380
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 42.380
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.437 0 0 0 0 0 290 286 205 262 171 151 72
2020/20211.384 146 98 101 45 111 74 86 124 183 121 84 211
2021/20221.857 61 80 55 85 578 202 39 64 136 53 130 374
2022/20231.683 205 188 116 128 173 203 41 100 365 7 130 27
2023/20246.388 218 189 265 142 284 287 30 50 16 4.674 35 198
2024/20251.219 50 192 68 267 471 171 0 0 0 0 0 0
Totale 19.385