Solving the hub location problem in a star–star network
✍ Scribed by Martine Labbé; Hande Yaman
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 273 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We 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. © 2007 Wiley Periodicals, Inc. NETWORKS, 2008
📜 SIMILAR VOLUMES
A cascade addrdrop transcei¨er CAT structure in a star-ring architecture for subcarrier-multiplexed passi¨e optical networks ( ) SCM᎐PONs is demonstrated to o¨ercome the optical beat interference ( ) OBI problem. The proposed CAT structure is a simple, reliable, and feasible approach for SCM᎐PONs. O
## Abstract Starting from the topicality of the issues related to the location of undesirable facilities and on the basis of a brief review of the types of models that are currently being used in the Municipal Solid Waste Management context, the present paper proposes a multicriteria approach that