IDEAS home Printed from
   My bibliography  Save this article

Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements


  • Kyungchul Park

    () (Telecommunication Network Research Lab., Korea Telecom, Wha-am-dong, Yusong-gu, Taejon, 305-348, Korea)

  • Kyungsik Lee

    () (Electronics and Telecommunication Research Institute, 161 Kajong-dong, Yusong-gu, Taejon, 305-350, Korea)

  • Sungsoo Park

    () (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Gusong-dong, Yusong-gu, Taejon, 305-701, Korea)

  • Heesang Lee

    () (Department of Industrial Engineering, Hankuk University of Foreign Studies, 89 Mohyun-ri, Wangsan-myun Yongin-gun, Kyunggi-do 449-791, Korea)


We 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.

Suggested Citation

  • Kyungchul Park & Kyungsik Lee & Sungsoo Park & Heesang Lee, 2000. "Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements," Management Science, INFORMS, vol. 46(3), pages 363-374, March.
  • Handle: RePEc:inm:ormnsc:v:46:y:2000:i:3:p:363-374

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Kyungchul Park & Seokhoon Kang & Sungsoo Park, 1996. "An Integer Programming Approach to the Bandwidth Packing Problem," Management Science, INFORMS, vol. 42(9), pages 1277-1291, September.
    2. Chung, Sung-hark & Myung, Young-soo & Tcha, Dong-wan, 1992. "Optimal design of a distributed network with a two-level hierarchical structure," European Journal of Operational Research, Elsevier, vol. 62(1), pages 105-115, October.
    3. Lee, Kyungsik & Park, Kyungchul & Park, Sungsoo & Lee, Heesang, 1998. "Economic spare capacity planning for DCS mesh-restorable networks," European Journal of Operational Research, Elsevier, vol. 110(1), pages 63-75, October.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Camacho-Collados, M. & Liberatore, F. & Angulo, J.M., 2015. "A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector," European Journal of Operational Research, Elsevier, vol. 246(2), pages 674-684.
    2. Rui Fragoso & Conceição Rego & Vladimir Bushenkov, 2016. "Clustering of Territorial Areas: A Multi-Criteria Districting Problem," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 14(2), pages 179-198, December.
    3. 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.
    4. Rajiv D. Banker & Robert J. Kauffman, 2004. "50th Anniversary Article: The Evolution of Research on Information Systems: A Fiftieth-Year Survey of the Literature in Management Science," Management Science, INFORMS, vol. 50(3), pages 281-298, March.
    5. Plastria, Frank, 2002. "Formulating logical implications in combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 140(2), pages 338-353, July.
    6. 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.
    7. 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.


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:46:y:2000:i:3:p:363-374. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.