Carpathian Journal of Mathematics, Vol. 25, No. 1 (2009), pp. 104-118 (15 pages) In this survey paper, we discuss the development of the Generalized Minimum Spanning Tree Problem, denoted by GMSTP, ...

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