Reformulations and Computational Results for the Uncapacitated Single. Allocation Hub Covering Problem

We study the single allocation hub covering problem, which is a special case of the general hub locationproblem. The hub covering problem is also an important extension to traditional network coveringproblems. Hubs are located at some nodes in the network and are used to facilitate – consolidate,transfer and distribute – flows of goods or information in such networks. An important feature in hublocation is that the transfer cost between hub nodes is often discounted. The hub covering problem isto locate a minimum number of hubs such that the travel cost between each o-d pair in the networkdoes not exceed a given threshold...