CINECA IRIS Institutional Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.537 266 156 188 229 261 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/202532 32 0 0 0 0 0 0 0 0 0 0 0
Totale 18.198