This problem is NP-complete and is also a generalization of the Traveling Salesman Problem. In this paper, we present a branch-and-bound algorithm for the exact solution of the Tree QAP based on an ...

In this paper, we proposed a multi-objective MIP model for IT allocation, and a Hungarian Algorithm is introduced to solve the problem in a preferable period of time. Numerical experiment shows that, ...