A Note on the Optimal Assignment of Facilities to Locations by Branch and Bound

The problem of the optimal assignment of facilities to locaticns has been solved by J.W. Gavett and Normann V.Plyter. In their paper the branch and bound technique is used and for this purpose the distance matrix is transformed into the matrix whose diagonal compoents are zero. The purpose of this paper is to avoid such a transformation and the store of the distance matrix into the computer.