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 ...

Abstract: This paper presents a method to certify the computational complexity of a standard Branch and Bound method for solving Mixed-Integer Quadratic Programming (MIQP) problems defined as ...

The Journal of the Operational Research Society, Vol. 47, No. 3 (Mar., 1996), pp. 457-462 (6 pages) In this paper we present a new branch and bound algorithm for solving a class of integer quadratic ...