In this thesis  we study three related decision problems in location theory The first part of the dissertation presents solution algorithms for the cycle hub location problem (CHLP)  which seeks to locate p-hub facilities that are connected by means of a cycle  and to assign non-hub nodes to hubs so as to minimize the total cost of routing flows through the network