Antonio Frangioni

According to our database1, Antonio Frangioni authored at least 66 papers between 1996 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 





Strengthening the sequential convex MINLP technique by perspective reformulations.
Optimization Letters, 2019

QPLIB: a library of quadratic programming instances.
Math. Program. Comput., 2019

Incremental Bundle Methods using Upper Models.
SIAM Journal on Optimization, 2018

Dynamic smoothness parameter for fast gradient methods.
Optimization Letters, 2018

Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G.
J. Network and Computer Applications, 2018

A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks.
Electronic Notes in Discrete Mathematics, 2018

Towards Robust Admission Control in Delay-Constrained Routing Problems.
Electronic Notes in Discrete Mathematics, 2018

Large-scale unit commitment under uncertainty: an updated literature survey.
Annals OR, 2018

Minimizing Power Consumption in Virtualized Cellular Networks.
Proceedings of the 87th IEEE Vehicular Technology Conference, 2018

Improving the Approximated Projected Perspective Reformulation by dual information.
Oper. Res. Lett., 2017

On the computational efficiency of subgradient methods: a case study with Lagrangian bounds.
Math. Program. Comput., 2017

Special issue on: Nonlinear and combinatorial methods for energy optimization.
EURO J. Computational Optimization, 2017

Delay-constrained routing problems: Accurate scheduling models and admission control.
Computers & OR, 2017

QoS routing with worst-case delay constraints: Models, algorithms and performance analysis.
Computer Communications, 2017

Flexible dynamic coordinated scheduling in virtual-RAN deployments.
Proceedings of the 2017 IEEE International Conference on Communications Workshops, 2017

Approximated perspective relaxations: a project and lift approach.
Comp. Opt. and Appl., 2016

Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support.
Comp. Opt. and Appl., 2016

Statistically Sound Experiments with OpenAirInterface Cloud-RAN Prototypes - CLEEN 2016.
Proceedings of the Cognitive Radio Oriented Wireless Networks, 2016

Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models.
J. Optimization Theory and Applications, 2015

Optimal Joint Path Computation and Rate Allocation for Real-time Traffic.
Comput. J., 2015

Accelerated multigrid for graph Laplacian operators.
Applied Mathematics and Computation, 2015

Large-scale Unit Commitment under uncertainty.
4OR, 2015

Bundle methods for sum-functions with "easy" components: applications to multicommodity network design.
Math. Program., 2014

Perspective Reformulations of the CTA Problem with L2 Distances.
Operations Research, 2014

Pairwise Compatibility Graphs of Caterpillars.
Comput. J., 2014

A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions.
SIAM Journal on Optimization, 2013

Math. Program., 2013

A stabilized structured Dantzig-Wolfe decomposition method.
Math. Program., 2013

A library for continuous convex separable quadratic knapsack problems.
European Journal of Operational Research, 2013

Bicriteria data compression.
CoRR, 2013

A storm of feasibility pumps for nonconvex MINLP.
Math. Program., 2012

Beyond Canonical DC-Optimization: The Single Reverse Polar Problem.
J. Optimization Theory and Applications, 2012

Piecewise-quadratic Approximations in Convex Numerical Optimization.
SIAM Journal on Optimization, 2011

Static and dynamic routing under disjoint dominant extreme demands.
Oper. Res. Lett., 2011

Projected Perspective Reformulations with Applications in Design Problems.
Operations Research, 2011

Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE.
Computers & OR, 2011

Transforming Mathematical Models Using Declarative Reformulation Rules.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011

On interval-subgradient and no-good cuts.
Oper. Res. Lett., 2010

Approximate optimality conditions and stopping criteria in canonical DC programming.
Optimization Methods and Software, 2010

Outer approximation algorithms for canonical DC problems.
J. Global Optimization, 2010

I-DARE: Intelligence-Driven Automatic Reformulation Engine.
ERCIM News, 2010

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Searching the Best (Formulation, Solver, Configuration) for Structured Problems.
Proceedings of the Complex Systems Design & Management, 2010

Convergence Analysis of Deflected Conditional Approximate Subgradient Methods.
SIAM Journal on Optimization, 2009

A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes.
Oper. Res. Lett., 2009

0-1 reformulations of the multicommodity capacitated network design problem.
Discrete Applied Mathematics, 2009

On the choice of explicit stabilizing terms in column generation.
Discrete Applied Mathematics, 2009

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP.
Oper. Res. Lett., 2007

Experiments with a hybrid interior point/combinatorial approach for network flow problems.
Optimization Methods and Software, 2007

Prim-based support-graph preconditioners for min-cost flow problems.
Comp. Opt. and Appl., 2007

Perspective cuts for a class of convex 0-1 mixed integer programs.
Math. Program., 2006

Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints.
Operations Research, 2006

A Computational Study of Cost Reoptimization for Min-Cost Flow Problems.
INFORMS Journal on Computing, 2006

New approaches for optimizing over the semimetric polytope.
Math. Program., 2005

About Lagrangian Methods in Integer Optimization.
Annals OR, 2005

New Preconditioners for KKT Systems of Network Flow Problems.
SIAM Journal on Optimization, 2004

A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems.
J. Comb. Optim., 2004

Optimizing over Semimetric Polytopes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

PaTre: A Method for Paralogy Trees Construction.
Journal of Computational Biology, 2003

Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems.
INFORMS Journal on Computing, 2003

Generalized Bundle Methods.
SIAM Journal on Optimization, 2002

Spectral Analysis of (Sequences of) Graph Matrices.
SIAM J. Matrix Analysis Applications, 2001

Bundle-based relaxation methods for multicommodity capacitated fixed charge network design.
Discrete Applied Mathematics, 2001

A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows.
Proceedings of the Vector and Parallel Processing, 2000

A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems.
INFORMS Journal on Computing, 1999

Solving semidefinite quadratic problems within nonsmooth optimization algorithms.
Computers & OR, 1996