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

This is a preview. Log in through your library . Abstract We introduce a new lower bound for the quadratic assignment problem based on a sequence of equivalent formulations of the problem. We present ...