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 is a preview. Log in through your library . Abstract In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a ...