An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...

This paper describes a branch and bound algorithm for the global minimization of a quadratic objective function subject to quadratic constraints over a bounded interval. No assumptions are made ...

The Cholesky factor is loaded into the quadratic programming subroutine, automatically ensuring positive definiteness of the problem. During the quadratic programming step, the Cholesky factor of the ...

The INQUAD= data set contains the arrays appearing in a quadratic programming problem. The INVAR= data set specifies initial values for the decision variables, the values of constants that are ...