Labbé, M.Yaman, H.2016-02-082016-02-0820080028-3045http://hdl.handle.net/11693/23239We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The aim is to minimize the cost of locating hubs, assigning terminals and routing the traffic between hubs and the central node. We present two formulations and show that the constraints are facet-defining inequalities in both cases. We test the formulations on a set of instances. Finally, we present a heuristic based on Lagrangian relaxation.EnglishHub locationStar–star networkPolyhedral analysisBranch and cutLagrangian relaxationArticle10.1002/net.201931097-0037