CNR Institutional Research Information System

FRANGIONI, ANTONIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.564
AS - Asia 1.811
EU - Europa 1.075
SA - Sud America 367
AF - Africa 44
OC - Oceania 3
Totale 5.864
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.528
SG - Singapore 682
RU - Federazione Russa 657
CN - Cina 465
BR - Brasile 286
VN - Vietnam 210
HK - Hong Kong 165
KR - Corea 109
IT - Italia 101
DE - Germania 97
FR - Francia 96
JP - Giappone 38
IN - India 33
AR - Argentina 29
GB - Regno Unito 21
NL - Olanda 21
BD - Bangladesh 17
IL - Israele 17
CA - Canada 16
FI - Finlandia 14
ZA - Sudafrica 14
AT - Austria 11
IQ - Iraq 11
PK - Pakistan 11
BE - Belgio 10
EC - Ecuador 10
ES - Italia 8
MX - Messico 8
PE - Perù 8
PY - Paraguay 8
TR - Turchia 8
CO - Colombia 7
CL - Cile 6
DZ - Algeria 6
ID - Indonesia 6
PL - Polonia 6
UA - Ucraina 6
AL - Albania 5
BO - Bolivia 5
CZ - Repubblica Ceca 5
IE - Irlanda 5
KE - Kenya 5
SA - Arabia Saudita 5
VE - Venezuela 5
CI - Costa d'Avorio 4
GR - Grecia 4
MA - Marocco 4
AE - Emirati Arabi Uniti 3
CR - Costa Rica 3
EG - Egitto 3
IR - Iran 3
TN - Tunisia 3
UY - Uruguay 3
UZ - Uzbekistan 3
AU - Australia 2
CY - Cipro 2
DO - Repubblica Dominicana 2
HN - Honduras 2
JO - Giordania 2
KH - Cambogia 2
KW - Kuwait 2
KZ - Kazakistan 2
MY - Malesia 2
PH - Filippine 2
RO - Romania 2
SE - Svezia 2
SN - Senegal 2
SV - El Salvador 2
TH - Thailandia 2
TW - Taiwan 2
AF - Afghanistan, Repubblica islamica di 1
AM - Armenia 1
BB - Barbados 1
BH - Bahrain 1
BJ - Benin 1
BN - Brunei Darussalam 1
CH - Svizzera 1
GE - Georgia 1
KG - Kirghizistan 1
KN - Saint Kitts e Nevis 1
MD - Moldavia 1
NG - Nigeria 1
NO - Norvegia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
PR - Porto Rico 1
SC - Seychelles 1
SI - Slovenia 1
Totale 5.864
Salva come PNG Salva come JPEG
Città #
Dallas 1.267
Santa Clara 758
Singapore 429
Hefei 250
Hong Kong 159
Seoul 106
Frankfurt am Main 84
San Jose 83
Lauterbourg 82
Ho Chi Minh City 76
Los Angeles 63
Ashburn 58
Hanoi 56
Beijing 41
Rome 33
São Paulo 31
Tokyo 16
Minamishinagawa 14
Helsinki 13
Bengaluru 12
Haiphong 11
New York 11
Da Nang 9
Mumbai 9
Milan 8
Houston 7
Johannesburg 7
Rio de Janeiro 7
Shanghai 7
West Jordan 7
Brussels 6
Buffalo 6
Council Bluffs 6
Lahore 6
Orem 6
Baghdad 5
Boardman 5
Campo Grande 5
Dublin 5
Lima 5
Osaka 5
Recife 5
Thái Bình 5
Abidjan 4
Asunción 4
Bogotá 4
Caxias do Sul 4
Cropani 4
Munich 4
Naples 4
Nuremberg 4
Vienna 4
Warsaw 4
Algiers 3
Amsterdam 3
Bologna 3
Brasília 3
Brooklyn 3
Can Tho 3
Cascina 3
Chengdu 3
Chicago 3
Conselheiro Lafaiete 3
Curitiba 3
Duque de Caxias 3
Groningen 3
Guarulhos 3
Guayaquil 3
Guro-gu 3
Ha Long 3
Hưng Yên 3
Istanbul 3
Itaquaquecetuba 3
Juiz de Fora 3
Lafayette 3
Milwaukee 3
Montevideo 3
Phoenix 3
Porto Alegre 3
Quận Bình Thạnh 3
São Bernardo do Campo 3
Tashkent 3
Tehran 3
Tirana 3
Toronto 3
Adana 2
Alto Paraíso de Goiás 2
Amman 2
Ancona 2
Ankara 2
Anápolis 2
Atlanta 2
Austin 2
Ballston Spa 2
Bangkok 2
Belém 2
Birmingham 2
Biên Hòa 2
Boydton 2
Buenos Aires 2
Totale 3.950
Salva come PNG Salva come JPEG
Nome #
0-1 Reformulations of the Multicommodity Capacitated Network Design Problem 2.136
Start-Up/Shut-Down MINLP Formulations for the Unit Commitment with ramp constraints 122
Comparing Formulations for Piecewise Convex Problems 98
A Lagrangian approach to Chance Constrained Routing with Local Broadcast 88
Lagrangian Methods and Dynamic Programming-Based MIP Formulations for the Unit Commitment Problem 83
Approximated Perspective Relaxations: a Project&Lift Approach 80
New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints 79
Comparing perspective reformulations for piecewise-convex optimization 69
Large-scale unit commitment under uncertainty: an updated literature survey 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
New MIP Formulations for the Single-Unit Commitment Problems with Ramping Constraints 60
A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks 59
A counterexample to an exact extended formulation for the single-unit commitment problem 58
Formulations for piecewise-convex problems 56
Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs 56
Standard bundle methods: Untrusted models and duality 54
Outer Approximation Algorithms for Canonical DC Problems 53
Generalized Bundle Methods for Sum-Functions with ``Easy'' Components: Applications to Multicommodity Network Design 52
Improving the Approximated Projected Perspective Reformulation by dual information 52
A Nonmonotone Proximal Bundle Method With (Potentially) Continuous Step Decisions 51
A matheuristic for integrated timetabling and vehicle scheduling 51
DP-based formulations of the Unit Commitment Problem and the Convex Hull of Star-Shaped MINLPs 51
New MI-SOCP formulations for the Unit Commitment problems with ramping constraints 49
Comparing perspective reformulations for piecewise-convex optimization 49
Projected Perspective Reformulations with Applications 48
A Learning-based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers 45
Stabilized benders methods for large-scale combinatorial optimization, with application to data privacy 43
QoS routing with worst-case delay constraints: Models, algorithms and performance analysis 43
Quasi-separable dantzig-wolfe reformulations for network design 43
Subgraph-based preconditioners for interior-point approaches to network flow problems 42
Bicriteria data compression 42
Solving Nonlinear Single-Unit Commitment problems with ramping constraints 41
Projected Perspective Reformulations with Applications in Design Problems 41
QPLIB: A Library of Quadratic Programming Instances 39
Optimization methods: An applications-oriented primer 38
Learning to configure mathematical programming solvers by mathematical programming 38
Strengthening the sequential convex MINLP technique by perspective reformulations 37
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs 34
Mathematical Optimization for Efficient and Robust Energy Networks 34
Strengthening the Sequential Convex MINLP Technique by Perspective Reformulations 34
QPLIB: a library of quadratic programming instances 34
On the Computationale Efficency of Subgradient Methods: a Case Study with Lagrangian Bounds 33
Bundle methods for sum-functions with "easy" components: Applications to multicommodity network design 33
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP 33
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs 32
Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support 32
Beyond Canonical DC-Optimization: the Single Reverse Polar Problem 32
Experiments with a hybrid Interior Point/Combinatorial Approach for Network Flow Problems 32
Deflected Conditional Approximate Subgradient Methods 31
Perspective cuts for a class of convex 0-1 mixed integer programs 31
A Computational Comparison of Reformulations of the Perspective Relaxation: SOCP vs. Cutting Planes 31
Perspective Reformulations of the CTA Problem with L2 Distances 31
Searching the Best (Formulation, Solver, Configuration) for Structured Problems 31
Minimizing power consumption in virtualized cellular networks 31
Delay-constrained routing problems: Accurate scheduling models and admission control 31
A set-covering formulation for a drayage problem with single and double container loads 30
Towards Robust Admission Control in Delay-Constrained Routing Problems 30
Hybrid lagrangian-MILP approaches for unit commitment problems 30
Tighter Approximated MILP Formulations for Unit Commitment Problems 30
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G 30
Prim-based support-graph preconditioners for Min-Cost Flow Problems 29
Comparing Spatial and Scenario Decomposition for Stochastic Hydrothermal Unit Commitment Problems 29
Experiments with a Feasibility Pump Approach for Non-Convex MINLPs 29
Hybrid Lagrangian-MILP Approaches for Unit Commitment Problems 29
A dynamic programming approach for single-unit commitment problems with ramping constraints 29
On the computational efficiency of subgradient methods: A case study with Lagrangian bounds 29
Tighter approximated MILP formulations for Unit Commitment Problems 29
Large-scale Unit Commitment under uncertainty: a literature survey 28
A Computational Study of Cost Reoptimization for Min Cost Flow Problems 28
Solving Unit Commitment problems with general ramp constraints 28
Inexact Stabilized Benders' Decomposition Approaches to Chance-constrained Problems with Finite Support 28
A Storm of Feasibility Pumps for Nonconvex MINLP 28
Strengthening Convex Relaxations of Mixed Integer Non Linear Programming Problems with Separable Non Convexities 28
Optimal Joint Path Computation and Rate Allocation for Real-time Traffic 28
Dynamic smoothness parameter for fast gradient methods 27
A Linear Programming Model for Traffic Engineering in 100% Survivable Networks under combined IS-IS/OSPF and MPLS-TE Protocols 27
Solving Unit Commitment Problems with General Ramp Constraints 27
Perspective cuts for 0-1 Mixed Integer Programming Problems 27
New Lagrangian heuristics for ramp-constrained unit commitment problems 27
Projected Perspective Reformulations with applications in design problems 26
New developments in the solution of Unit Commitment problems 26
Incremental bundle methods using upper models 26
Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models 25
Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models 25
Outer Approximation Algorithms for Canonical Reverse-Polar Problems 24
A Stabilized Structured Dantzig-Wolfe Decomposition Method 24
Experiments with a hybrid interior point/combinatorial approach for network flow problems 24
Unit Commitment Models with Power Variables 24
Perspective Reformulations of the CTA Problem With L2 Distances 23
A Library for Continuous Convex Separable Quadratic Knapsack Problems 22
On Interval-subgradient and No-good Cuts 22
Projected Perspective Reformulations for MIQP problems 21
Solving Network Problems with Interior Point Methods and Preconditioned Conjugates Gradient Method 20
null 3
Totale 5.896
Salva come PNG Salva come JPEG
Categoria #
all - tutte 14.236
article - articoli 5.672
book - libri 125
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 449
Totale 20.482
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2023/202418 0 0 0 0 0 0 0 1 0 7 6 4
2024/20251.723 4 9 91 111 670 116 22 44 15 30 327 284
2025/20264.074 126 767 1.002 320 312 123 394 85 790 70 53 32
2026/202781 81 0 0 0 0 0 0 0 0 0 0 0
Totale 5.896