Home » Publication » 24537

Dettaglio pubblicazione


A computational study on QP problems with general linear constraints (01a Articolo in rivista)

Liuzzi G., Locatelli M., Piccialli V.

In this paper we consider Quadratic Programming (QP) problems with general linear constraints. We show, through a computational investigation, that a careful selection of a suitable reformulation of such problems, together with the related relaxation, and an intensive application of bound tightening are simple but very effective ingredients in order to make a standard branch and bound approach very competitive and in some cases able to outperform even well known commercial solvers.
Gruppo di ricerca: Continuous Optimization
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma