Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements
AbstractWe consider the node clustering problem that arises in designing a survivable two-level telecommunication network. The problem simultaneously determines an optimal partitioning of the whole network into clusters (local networks) and hub locations in each cluster. Intercluster traffic minimization is chosen as the clustering criterion to improve the service quality. Various constraints on the clustering are considered which reflect both the physical structures of local networks, such as the connectivity requirement, and the node compatibility relations such as community of interest or policy. Additional constraints may be imposed on the hub selection to ensure network survivability. We propose an integer programming formulation of the problem by decomposing the entire problem into a master problem and a number of column generation problems. The master problem is solved by column generation and the column generation problems by branch-and-cut. We develop and use strong cutting-planes for the cluster generation subproblems. Computational results using real data are reported.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 46 (2000)
Issue (Month): 3 (March)
network design; clustering; column generation; branch-and-cut;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Tavares Pereira, Fernando & Figueira, José Rui & Mousseau, Vincent & Roy, Bernard, 2009. "Comparing two territory partitions in districting problems: Indices and practical issues," Socio-Economic Planning Sciences, Elsevier, vol. 43(1), pages 72-88, March.
- Matsubayashi, Nobuo & Umezawa, Masashi & Masuda, Yasushi & Nishino, Hisakazu, 2005. "A cost allocation problem arising in hub-spoke network systems," European Journal of Operational Research, Elsevier, vol. 160(3), pages 821-838, February.
- Plastria, Frank, 2002. "Formulating logical implications in combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 140(2), pages 338-353, July.
- Marc Bollecker & Wilfrid Azan, 2008. "Les frontières de la recherche en contrôle de gestion : une analyse des cadres théoriques mobilisés," Post-Print halshs-00522395, HAL.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.