default search action
Antonio Frangioni
Person information
- affiliation: University of Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j71]Antonio Frangioni, Fabrizio Lacalandra:
A bilevel programming approach to price decoupling in Pay-as-Clear markets, with application to day-ahead electricity markets. Eur. J. Oper. Res. 319(1): 316-331 (2024) - [j70]Tiziano Bacci, Antonio Frangioni, Claudio Gentile, Kostas Tavlaridis-Gyparakis:
New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints. Oper. Res. 72(5): 2153-2167 (2024) - [i8]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
A learning-based mathematical programming formulation for the automatic configuration of optimization solvers. CoRR abs/2401.04237 (2024) - [i7]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
Learning to Configure Mathematical Programming Solvers by Mathematical Programming. CoRR abs/2401.05041 (2024) - [i6]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
The Algorithm Configuration Problem. CoRR abs/2403.00898 (2024) - 2023
- [j69]Annabella Astorino, Antonio Frangioni, Enrico Gorgone, Benedetto Manca:
Ellipsoidal classification via semidefinite programming. Oper. Res. Lett. 51(2): 197-203 (2023) - [j68]Renan Spencer Trindade, Claudia D'Ambrosio, Antonio Frangioni, Claudio Gentile:
Comparing perspective reformulations for piecewise-convex optimization. Oper. Res. Lett. 51(6): 702-708 (2023) - [j67]Matteo Cacciola, Antonio Frangioni, Xinlin Li, Andrea Lodi:
Deep Neural Networks Pruning via the Structured Perspective Regularization. SIAM J. Math. Data Sci. 5(4): 1051-1077 (2023) - [j66]Teodor Gabriel Crainic, Antonio Frangioni, Michel Gendreau:
In Memoriam: Bernard Gendron,1966-2022. Transp. Sci. 57(1): 1-3 (2023) - [c14]Matteo Cacciola, Antonio Frangioni, Masoud Asgharian, Alireza Ghaffari, Vahid Partovi Nia:
On the Convergence of Stochastic Gradient Descent in Low-Precision Number Formats. ICPRAM 2023: 542-549 - [i5]Matteo Cacciola, Antonio Frangioni, Masoud Asgharian, Alireza Ghaffari, Vahid Partovi Nia:
On the Convergence of Stochastic Gradient Descent in Low-precision Number Formats. CoRR abs/2301.01651 (2023) - [i4]Matteo Cacciola, Antonio Frangioni, Andrea Lodi:
Structured Pruning of Neural Networks for Constraints Learning. CoRR abs/2307.07457 (2023) - 2022
- [j65]Matteo Andreozzi, Antonio Frangioni, Laura Galli, Giovanni Stea, Raffaele Zippo:
A MILP approach to DRAM access worst-case analysis. Comput. Oper. Res. 143: 105774 (2022) - [j64]Mohammad Rahim Akhavan Kazemzadeh, Tolga Bektas, Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design. Discret. Appl. Math. 308: 255-275 (2022) - [j63]Teodor Gabriel Crainic, Antonio Frangioni, Michel Gendreau:
Bernard Gendron (1966-2022): friend and colleague. INFOR Inf. Syst. Oper. Res. 60(4): 429-431 (2022) - [j62]Teodor Gabriel Crainic, Antonio Frangioni, Michel Gendreau:
Bernard Gendron (1966-2022): Un ami et un collègue. INFOR Inf. Syst. Oper. Res. 60(4): 432-435 (2022) - [i3]Matteo Cacciola, Antonio Frangioni, Xinlin Li, Andrea Lodi:
Deep Neural Networks pruning via the Structured Perspective Regularization. CoRR abs/2206.14056 (2022) - 2021
- [j61]Ali Ghezelsoflu, Massimo Di Francesco, Antonio Frangioni, Paola Zuddas:
A multiperiod drayage problem with customer-dependent service periods. Comput. Oper. Res. 129: 105189 (2021) - [j60]Antonio Frangioni, Stefania Pan, Emiliano Traversi, Roberto Wolfler Calvo:
A constraints-aware Reweighted Feasibility Pump approach. Oper. Res. Lett. 49(5): 671-675 (2021) - 2020
- [j59]Daniel Baena, Jordi Castro, Antonio Frangioni:
Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy. Manag. Sci. 66(7): 3051-3068 (2020) - [j58]Antonio Frangioni, Claudio Gentile, James T. Hungerford:
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs. Math. Oper. Res. 45(1): 15-33 (2020) - [c13]Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
Quasi-Separable Dantzig-Wolfe Reformulations for Network Design. ISCO 2020: 227-236 - [c12]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
Learning to Configure Mathematical Programming Solvers by Mathematical Programming. LION 2020: 377-389 - [c11]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
A Learning-Based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers. LOD (1) 2020: 700-712
2010 – 2019
- 2019
- [j57]Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros M. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele:
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - [j56]Claudia D'Ambrosio, Antonio Frangioni, Claudio Gentile:
Strengthening the sequential convex MINLP technique by perspective reformulations. Optim. Lett. 13(4): 673-684 (2019) - [j55]Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini:
Bicriteria Data Compression. SIAM J. Comput. 48(5): 1603-1642 (2019) - 2018
- [j54]Wim van Ackooij, I. Danti Lopez, Antonio Frangioni, Fabrizio Lacalandra, Milad Tahanan:
Large-scale unit commitment under uncertainty: an updated literature survey. Ann. Oper. Res. 271(1): 11-85 (2018) - [j53]Antonio Frangioni, Laura Galli, Giovanni Stea:
Towards Robust Admission Control in Delay-Constrained Routing Problems. Electron. Notes Discret. Math. 69: 45-52 (2018) - [j52]Ali Ghezelsoflu, Massimo Di Francesco, Paola Zuddas, Antonio Frangioni:
A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks. Electron. Notes Discret. Math. 69: 237-244 (2018) - [j51]Giovanni Nardini, Giovanni Stea, Antonio Virdis, Antonio Frangioni, Laura Galli, Dario Sabella, Gian Michele Dell'Aera:
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G. J. Netw. Comput. Appl. 106: 1-16 (2018) - [j50]Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
Dynamic smoothness parameter for fast gradient methods. Optim. Lett. 12(1): 43-53 (2018) - [j49]Wim van Ackooij, Antonio Frangioni:
Incremental Bundle Methods using Upper Models. SIAM J. Optim. 28(1): 379-410 (2018) - [c10]Giovanni Nardini, Antonio Virdis, Niccolo Iardella, Antonio Frangioni, Laura Galli, Giovanni Stea:
Minimizing Power Consumption in Virtualized Cellular Networks. VTC Spring 2018: 1-6 - 2017
- [j48]Antonio Frangioni, Laura Galli, Giovanni Stea:
QoS routing with worst-case delay constraints: Models, algorithms and performance analysis. Comput. Commun. 103: 104-115 (2017) - [j47]Antonio Frangioni, Laura Galli, Giovanni Stea:
Delay-constrained routing problems: Accurate scheduling models and admission control. Comput. Oper. Res. 81: 67-77 (2017) - [j46]Claudia D'Ambrosio, Antonio Frangioni, Andrea Lodi, Martin Mevissen:
Special issue on: Nonlinear and combinatorial methods for energy optimization. EURO J. Comput. Optim. 5(1-2): 1-3 (2017) - [j45]Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds. Math. Program. Comput. 9(4): 573-604 (2017) - [j44]Antonio Frangioni, Fabio Furini, Claudio Gentile:
Improving the Approximated Projected Perspective Reformulation by dual information. Oper. Res. Lett. 45(5): 519-524 (2017) - [c9]Niccolo Iardella, Giovanni Nardini, Giovanni Stea, Antonio Virdis, Antonio Frangioni, Laura Galli, Dario Sabella, Francesco Mauro, Gian Michele Dell'Aera, Marco Caretti:
Flexible dynamic coordinated scheduling in virtual-RAN deployments. ICC Workshops 2017: 126-131 - 2016
- [j43]Antonio Frangioni, Fabio Furini, Claudio Gentile:
Approximated perspective relaxations: a project and lift approach. Comput. Optim. Appl. 63(3): 705-735 (2016) - [j42]Wim van Ackooij, Antonio Frangioni, Welington de Oliveira:
Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support. Comput. Optim. Appl. 65(3): 637-669 (2016) - [c8]Niccolo Iardella, Giovanni Stea, Antonio Virdis, Dario Sabella, Antonio Frangioni:
Statistically Sound Experiments with OpenAirInterface Cloud-RAN Prototypes - CLEEN 2016. CrownCom 2016: 754-766 - 2015
- [j41]Milad Tahanan, Wim van Ackooij, Antonio Frangioni, Fabrizio Lacalandra:
Large-scale Unit Commitment under uncertainty. 4OR 13(2): 115-171 (2015) - [j40]Pietro Dell'Acqua, Antonio Frangioni, Stefano Serra-Capizzano:
Accelerated multigrid for graph Laplacian operators. Appl. Math. Comput. 270: 193-215 (2015) - [j39]Antonio Frangioni, Laura Galli, Giovanni Stea:
Optimal Joint Path Computation and Rate Allocation for Real-time Traffic. Comput. J. 58(6): 1416-1430 (2015) - [j38]Antonio Frangioni, Laura Galli, Maria Grazia Scutellà:
Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models. J. Optim. Theory Appl. 164(3): 1051-1077 (2015) - 2014
- [j37]Tiziana Calamoneri, Antonio Frangioni, Blerina Sinaimeri:
Pairwise Compatibility Graphs of Caterpillars. Comput. J. 57(11): 1616-1623 (2014) - [j36]Jordi Castro, Antonio Frangioni, Claudio Gentile:
Perspective Reformulations of the CTA Problem with L2 Distances. Oper. Res. 62(4): 891-909 (2014) - [j35]Antonio Frangioni, Enrico Gorgone:
Bundle methods for sum-functions with "easy" components: applications to multicommodity network design. Math. Program. 145(1-2): 133-161 (2014) - [c7]Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini:
Bicriteria data compression. SODA 2014: 1582-1595 - 2013
- [j34]Antonio Frangioni, Enrico Gorgone:
A library for continuous convex separable quadratic knapsack problems. Eur. J. Oper. Res. 229(1): 37-40 (2013) - [j33]Antonio Frangioni, Michael L. Overton, Claudia A. Sagastizábal:
Preface. Math. Program. 140(1): 1-3 (2013) - [j32]Antonio Frangioni, Bernard Gendron:
A stabilized structured Dantzig-Wolfe decomposition method. Math. Program. 140(1): 45-76 (2013) - [j31]Annabella Astorino, Antonio Frangioni, Antonio Fuduli, Enrico Gorgone:
A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions. SIAM J. Optim. 23(3): 1784-1809 (2013) - [i2]Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini:
Bicriteria data compression. CoRR abs/1307.3872 (2013) - 2012
- [j30]Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang:
Beyond Canonical DC-Optimization: The Single Reverse Polar Problem. J. Optim. Theory Appl. 155(2): 430-452 (2012) - [j29]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136(2): 375-402 (2012) - 2011
- [j28]Davide Cherubini, Alessandra Fanni, Anna Mereu, Antonio Frangioni, C. Murgia, Maria Grazia Scutellà, Paola Zuddas:
Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE. Comput. Oper. Res. 38(12): 1805-1815 (2011) - [j27]Antonio Frangioni, Claudio Gentile, Enrico Grande, Andrea Pacifici:
Projected Perspective Reformulations with Applications in Design Problems. Oper. Res. 59(5): 1225-1232 (2011) - [j26]Antonio Frangioni, F. Pascali, Maria Grazia Scutellà:
Static and dynamic routing under disjoint dominant extreme demands. Oper. Res. Lett. 39(1): 36-39 (2011) - [j25]Annabella Astorino, Antonio Frangioni, Manlio Gaudioso, Enrico Gorgone:
Piecewise-quadratic Approximations in Convex Numerical Optimization. SIAM J. Optim. 21(4): 1418-1438 (2011) - [c6]Antonio Frangioni, Luis Perez Sanchez:
Transforming Mathematical Models Using Declarative Reformulation Rules. LION 2011: 407-422 - 2010
- [j24]Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang:
Outer approximation algorithms for canonical DC problems. J. Glob. Optim. 46(2): 163-189 (2010) - [j23]Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang:
Approximate optimality conditions and stopping criteria in canonical DC programming. Optim. Methods Softw. 25(1): 19-27 (2010) - [j22]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
On interval-subgradient and no-good cuts. Oper. Res. Lett. 38(5): 341-345 (2010) - [c5]Antonio Frangioni, Luis Perez Sanchez:
Searching the Best (Formulation, Solver, Configuration) for Structured Problems. CSDM 2010: 85-98 - [c4]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. SEA 2010: 350-360 - [i1]Antonio Frangioni, Luis Perez Sanchez:
I-DARE: Intelligence-Driven Automatic Reformulation Engine. ERCIM News 2010(81) (2010)
2000 – 2009
- 2009
- [j21]Hatem Ben Amor, Jacques Desrosiers, Antonio Frangioni:
On the choice of explicit stabilizing terms in column generation. Discret. Appl. Math. 157(6): 1167-1184 (2009) - [j20]Antonio Frangioni, Bernard Gendron:
0-1 reformulations of the multicommodity capacitated network design problem. Discret. Appl. Math. 157(6): 1229-1241 (2009) - [j19]Antonio Frangioni, Claudio Gentile:
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes. Oper. Res. Lett. 37(3): 206-210 (2009) - [j18]Giacomo d'Antonio, Antonio Frangioni:
Convergence Analysis of Deflected Conditional Approximate Subgradient Methods. SIAM J. Optim. 20(1): 357-386 (2009) - [c3]Anna Mereu, Davide Cherubini, Alessandra Fanni, Antonio Frangioni:
Primary and backup paths optimal design for traffic engineering in hybrid IGP/MPLS networks. DRCN 2009: 273-280 - 2007
- [j17]Antonio Frangioni, Claudio Gentile:
Prim-based support-graph preconditioners for min-cost flow problems. Comput. Optim. Appl. 36(2-3): 271-287 (2007) - [j16]Antonio Frangioni, Claudio Gentile:
Experiments with a hybrid interior point/combinatorial approach for network flow problems. Optim. Methods Softw. 22(4): 573-585 (2007) - [j15]Antonio Frangioni, Claudio Gentile:
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP. Oper. Res. Lett. 35(2): 181-185 (2007) - 2006
- [j14]Antonio Frangioni, Antonio Manca:
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems. INFORMS J. Comput. 18(1): 61-70 (2006) - [j13]Antonio Frangioni, Claudio Gentile:
Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints. Oper. Res. 54(4): 767-775 (2006) - [j12]Antonio Frangioni, Claudio Gentile:
Perspective cuts for a class of convex 0-1 mixed integer programs. Math. Program. 106(2): 225-236 (2006) - 2005
- [j11]Antonio Frangioni:
About Lagrangian Methods in Integer Optimization. Ann. Oper. Res. 139(1): 163-193 (2005) - [j10]Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi:
New approaches for optimizing over the semimetric polytope. Math. Program. 104(2-3): 375-388 (2005) - 2004
- [j9]Antonio Frangioni, Emiliano Necciari, Maria Grazia Scutellà:
A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems. J. Comb. Optim. 8(2): 195-220 (2004) - [j8]Antonio Frangioni, Claudio Gentile:
New Preconditioners for KKT Systems of Network Flow Problems. SIAM J. Optim. 14(3): 894-913 (2004) - [c2]Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi:
Optimizing over Semimetric Polytopes. IPCO 2004: 431-443 - 2003
- [j7]Paola Cappanera, Antonio Frangioni:
Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems. INFORMS J. Comput. 15(4): 369-384 (2003) - [j6]Nadia Pisanti, Roberto Marangoni, Paolo Ferragina, Antonio Frangioni, A. Savona, C. Pisanelli, Fabrizio Luccio:
PaTre: A Method for Paralogy Trees Construction. J. Comput. Biol. 10(5): 791-802 (2003) - 2002
- [j5]Antonio Frangioni:
Generalized Bundle Methods. SIAM J. Optim. 13(1): 117-156 (2002) - 2001
- [j4]Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron:
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discret. Appl. Math. 112(1-3): 73-99 (2001) - [j3]Antonio Frangioni, Stefano Serra-Capizzano:
Spectral Analysis of (Sequences of) Graph Matrices. SIAM J. Matrix Anal. Appl. 23(2): 339-348 (2001) - 2000
- [c1]Jordi Castro, Antonio Frangioni:
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows. VECPAR 2000: 301-315
1990 – 1999
- 1999
- [j2]Antonio Frangioni, Giorgio Gallo:
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems. INFORMS J. Comput. 11(4): 370-393 (1999) - 1996
- [j1]Antonio Frangioni:
Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput. Oper. Res. 23(11): 1099-1118 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint