Computational study of a family of mixed-integer quadratic programming problems

Abstract

We present computational experience with a branch and cut algorithm to solve quadratic programming problems where there is an upper bound on the number os the variables positives. Such problems arise financial applications. The algorithm solves the largest real life problems in a few minutes of run-time.