CINECA IRIS Institutional Research Information System

FRANGIONI, ANTONIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 7211
EU - Europa 2773
AS - Asia 920
AF - Africa 37
SA - Sud America 27
Continente sconosciuto - Info sul continente non disponibili 11
OC - Oceania 7
Totale 10986
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6995
SE - Svezia 706
IT - Italia 696
CN - Cina 543
DE - Germania 367
BG - Bulgaria 329
CA - Canada 215
GB - Regno Unito 189
VN - Vietnam 169
UA - Ucraina 141
TR - Turchia 133
FI - Finlandia 82
RU - Federazione Russa 51
AT - Austria 35
BE - Belgio 30
FR - Francia 30
HK - Hong Kong 30
IE - Irlanda 29
CI - Costa d'Avorio 26
GR - Grecia 25
NL - Olanda 20
BR - Brasile 18
CH - Svizzera 12
ES - Italia 10
IN - India 8
AU - Australia 7
EU - Europa 7
KR - Corea 7
RO - Romania 7
CL - Cile 6
ID - Indonesia 6
NG - Nigeria 5
TW - Taiwan 5
A1 - ???statistics.table.value.countryCode.A1??? 4
JP - Giappone 4
MU - Mauritius 4
PK - Pakistan 4
HU - Ungheria 3
IR - Iran 3
SG - Singapore 3
CZ - Repubblica Ceca 2
MY - Malesia 2
PL - Polonia 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 10986
Salva come PNG Salva come JPEG
Città #
Woodbridge 1154
Ann Arbor 919
Fairfield 917
Houston 857
Chandler 449
Seattle 365
Ashburn 360
Sofia 329
Cambridge 302
Wilmington 291
Serra 261
Jacksonville 216
Ottawa 183
Beijing 150
Princeton 149
Izmir 124
Nanjing 122
Lawrence 113
Frankfurt am Main 105
Medford 97
Dong Ket 80
Des Moines 73
Lancaster 70
San Diego 50
Jüchen 43
Dearborn 39
Bondeno 36
Nanchang 32
Redwood City 32
Brussels 30
Falls Church 30
Guangzhou 29
Pisa 27
Vienna 27
Abidjan 26
Boardman 20
Hebei 19
Kunming 19
Karlsruhe 18
London 18
Boulder 17
Jinan 17
Crespellano 16
Los Angeles 16
Shenyang 16
Tianjin 16
Fuzhou 15
Phoenix 15
Hangzhou 14
Alessandria 13
Montréal 13
Sacile 12
Changsha 11
Chengdu 11
Dublin 11
Norwalk 11
Pistoia 11
Rome 11
Auburn Hills 10
Milan 10
Shanghai 10
Wuhan 10
Ciampino 9
Hefei 9
Orange 9
San Jose 9
Florence 8
Viareggio 8
Pittsburgh 7
Shenzhen 7
Düsseldorf 6
Indiana 6
Munich 6
Philadelphia 6
Zhengzhou 6
Bremen 5
Cagliari 5
Changchun 5
Dallas 5
Grafing 5
Jiaxing 5
Lagos 5
Ludwigshafen 5
Moscow 5
New York 5
Redmond 5
San Vincenzo 5
Santiago 5
Taipei 5
Torino 5
Atlanta 4
Bologna 4
Central District 4
Darmstadt 4
Florianópolis 4
Istanbul 4
Man Kok 4
North York 4
Nürnberg 4
Vancouver 4
Totale 8678
Salva come PNG Salva come JPEG
Nome #
0-1 Reformulations of the Multicommodity Capacitated Network Design Problem 295
0-1 Reformulations of the Network Loading Problem 277
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G 241
A set-covering formulation for a drayage problem with single and double container loads 174
Beyond canonical DC-Optimization: the single reverse polar problem 163
Minimizing power consumption in virtualized cellular networks 150
Optimal joint path computation and rate allocation for real-time traffic 148
Perspective cuts for a class of convex 0–1 mixed integer programs 147
A testbed for flexible and energy-efficient resource management with virtualized LTE-A nodes 146
Computational Evaluation of Multi-Iterative Approaches for Solving Graph-Structured Large Linear Systems 143
On the Choice of Explicit Stabilizing Terms in Column Generation 141
Large-scale Unit Commitment under uncertainty 135
Accelerated Multigrid for Graph Laplacian Operators 132
Scalability and energy efficiency of Coordinated Scheduling in cellular networks towards 5G 130
Bicriteria Data Compression 130
Piecewise Quadratic Approximations in Convex Numerical Optimization 129
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs 129
Bicriteria data compression 127
QoS Routing with worst-case delay constraints: models, algorithms and performance analysis 127
Delay-constrained Routing Problems: Accurate Scheduling Models and Admission Control 126
A Library for Continuous Convex Separable Quadratic Knapsack Problems 125
Flexible dynamic Coordinated Scheduling in Virtual-RAN deployments 125
New approaches for optimizing over the semimetric polytope 123
Delay-constrained shortest paths: approximation algorithms and second-order cone models 123
Incremental bundle methods using upper models 123
A Nonmonotone Proximal Bundle Method With (Potentially) Continuous Step Decisions 122
On a New Class of Bilevel Programming Problems and its Use For Reformulating Mixed Integer Problems 119
A Computational Study of Cost Reoptimization for Min Cost Flow Problems 119
SDP Diagonalizations and Perspective Cuts for a Class of Nonseparable MIQP 118
Lagrangian Heuristics Based on Disaggregated Bundle Methods for Hydrothermal Unit Commitment 117
Tighter Approximated MILP Formulations for Unit Commitment Problems 116
Generalized Bundle Methods 116
Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multi-Commodity Flow Problems 115
Solving Semidefinite Quadratic Problems Within Nonsmooth Optimization Algorithms 114
Convergence Analysis of Deflected Conditional Approximate Subgradient Methods 114
Approximate optimality conditions and stopping criteria in canonical DC programming 114
Searching the Best (Formulation, Solver, Configuration) for Structured Problems 114
Statistically Sound Experiments with OpenAirInterface Cloud-RAN Prototypes 114
On the Computational Efficiency of Subgradient Methods: a Case Study with Lagrangian Bounds 114
A Computational Comparison of Reformulations of the Perspective Relaxation: SOCP vs. Cutting Planes 113
Comparing Spatial and Scenario Decomposition for Stochastic Hydrothermal Unit Commitment Problems 113
About Lagrangian Methods in Integer Optimization 112
A Price-and-Branch Algorithm for a Drayage Problem with Heterogeneous Trucks 112
Towards Robust Admission Control in Delay-Constrained Routing Problems 108
A Storm of Feasibility Pumps for Nonconvex MINLP 108
Prim-based Support-Graph Preconditioners for Min-Cost Flow Problems 107
A Bundle Type Dual-ascent Approach to Linear Multicommodity Min Cost Flow Problems 107
Primary and Backup Paths Optimal Design for Traffic Engineering in Hybrid IGP/MPLS Networks 105
Large-scale Unit Commitment Under Uncertainty: an Updated Literature Survey 105
Optimizing over Semimetric Polytopes 104
Spectral Analysis of (Sequences of) Graph Matrices 104
New Preconditioners for KKT Systems of Network Flow Problems 103
Experiments with a Feasibility Pump Approach for Non-Convex MINLPs 103
Lagrangian Relaxation and Tabu Search Approaches for the Unit Commitment Problem 103
Projected Perspective Reformulations with Applications in Design Problems 102
A matheuristic for integrated timetabling and vehicle scheduling 102
A Stabilized Structured Dantzig-Wolfe Decomposition Method 101
A Multi-exchange Neighborhood for Minimum Makespan Machine Scheduling Problems 101
Transforming Mathematical Models Using Declarative Reformulation Rules 100
Experiments with Hybrid Interior Point/Combinatorial Approaches for Network Flow Problems 98
Multicommodity Capacitated Network Design 98
Improving the Approximated Projected Perspective Reformulation by Dual Information 98
Generalized Bundle Methods for Sum-Functions with "Easy" Components: Applications to Multicommodity Network Design 97
Outer Approximation Algorithms for Canonical DC Problems 96
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows 95
Using of a cost-based Unit Commitment algorithm to assist bidding strategy decisions 95
Static and Dynamic Routing Under Disjoint Dominant Extreme Demands 95
Inexact Stabilized Benders' Decomposition Approaches, with Application to Chance-Constrained Problems with Finite Support 93
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") 93
On Interval-subgradient and No-good Cuts 92
Dynamic Smoothness Parameter for Fast Gradient Methods 91
Chance Constrained Network Design 88
null 85
Strengthening the Sequential Convex MINLP Technique by Perspective Reformulations 85
QPLIB: A Library of Quadratic Programming Instances 84
New Lagrangian Heuristics for Ramp-Constrained Unit Commitment Problems 83
null 82
PaTre: a method for Paralogy Trees Construction 82
PaTre: A METHOD FOR PARALOGY TREE CONSTRUCTION 81
Solving Unit Commitment Problems with General Ramp Contraints 80
Outer Approximation Algorithms for Canonical Reverse-Polar Problems 79
Special issue on “Convex Analysis, Optimization and Applications” 79
Mathematical Optimization for Efficient and Robust Energy Networks 77
Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy 76
Genomic information and biological evolution: some results on genes families 75
A Tool for Practical Integrated Time-Table Design and Vehicle Scheduling in Public Transport Systems 75
Proceedings of INOC 2009 74
Appunti di Ricerca Operativa 73
Appunti di Ricerca Operativa 73
Applying Bundle Methods to Optimization of Polyhedral Functions: An Applications-Oriented Development 71
null 68
Linear Programming Models for Traffic Engineering in 100% Survivable Networks under combined IS-IS/OSPF and MPLS-TE Protocols 67
Special issue of EURO Journal on Computational Optimization on "Nonlinear and Combinatorial Methods for Energy Optimization" 64
Perspective Reformulations of the CTA Problem with L_2 Distances 63
Projected Perspective Reformulations for NonLinear Network Design Problems 62
A Lagrangian approach to Chance Constrained Routing with Local Broadcast 62
Multi-exchange algorithms for the minimum makespan machine scheduling problem 60
Approximated Perspective Relaxations: a Project&Lift Approach 59
NUOVI PROBLEMI DI OTTIMIZZAZIONE PER I PRODUTTORI IN UN MERCATO COMPETITIVO DELL’ENERGIA ELETTRICA 56
Solving Stochastic Hydrothermal Unit Commitment with a New Primal Recovery Technique Based on Lagrangian Solutions 53
Totale 10805
Salva come PNG Salva come JPEG
Categoria #
all - tutte 18041
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 18041
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2017/2018206 0000 00 00 59439212
2018/20191450 1529148 12420 31617 101255313238
2019/20202507 260153185227 257288 283204 25917015071
2020/20211367 1439810044 10773 85124 18112082210
2021/20221840 61805283 573200 3964 13553128372
2022/20231470 203187115128 173202 49107 306000
Totale 11441