An efficient node partitioning algorithm for the capacitated minimum spanning tree problem

被引：0
|
作者：
Han, Jun [1 ]
Sun, Zhaohao [2 ]
Huai, Jinpeng [1 ]
Li, Xian [1 ]
机构：
[1] Beihang Univ, Sch Comp Sci & Engn, Beijing, Peoples R China
[2] Univ Wollongong, Sch Econ & Informat Syst, Wollongong, NSW, Australia
来源：
6TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, PROCEEDINGS | 2007年
基金：
中国国家自然科学基金;
关键词：
D O I：
10.1109/ICIS.2007.56
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper studies the capacitated minimum spanning tree (CMST) problem, which is one of the most fundamental and significant problems in the optimal design of communication networks. A solution method using combined neighborhood search and branch and bound technique is introduced and its performance is presented The advantage of the algorithm is shown while the process of searching for the optimal solution is illustrated Computational experiences demonstrate that the proposed strategy significantly improves the efficiency of the previous node-orientated branch and bound algorithm.
引用
收藏
页码：575 / +
页数：2
相关论文
共 50 条
  • [1] A genetic algorithm for the Capacitated Minimum Spanning Tree problem
    de Lacerda, Estefane George Macedo
    de Medeiros, Manoel Firmino
    [J]. 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 725 - +
  • [2] A node-oriented branch and bound algorithm for the capacitated minimum spanning tree problem
    Han, J
    McMahon, G
    Sugden, S
    [J]. LCN 2003: 28TH CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS, 2003, : 460 - 469
  • [3] A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
    Lu, Yongliang
    Benlic, Una
    Wu, Qinghua
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2022, 144
  • [4] An approximation algorithm for the balanced capacitated minimum spanning tree problem
    Fallah H.
    Didehvar F.
    Rahmati F.
    [J]. Scientia Iranica, 2021, 28 (3 D) : 1479 - 1492
  • [5] A branch and bound algorithm for capacitated minimum spanning tree problem
    Han, J
    McMahon, G
    Sugden, S
    [J]. EURO-PAR 2002 PARALLEL PROCESSING, PROCEEDINGS, 2002, 2400 : 404 - 407
  • [6] A genetic algorithm approach on capacitated minimum spanning tree problem
    Zhou, Gengui
    Cao, Zhenyu
    Cao, Jian
    Meng, Zhiqing
    [J]. 2006 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PTS 1 AND 2, PROCEEDINGS, 2006, : 215 - 218
  • [7] An approximation algorithm for the balanced capacitated minimum spanning tree problem
    Fallah, H.
    Didehvar, F.
    Rahmati, F.
    [J]. SCIENTIA IRANICA, 2021, 28 (03) : 1479 - 1492
  • [8] A filter-and-fan algorithm for the capacitated minimum spanning tree problem
    Rego, Cesar
    Mathew, Frank
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 60 (02) : 187 - 194
  • [9] A BRANCH-AND-BOUND ALGORITHM FOR THE CAPACITATED MINIMUM SPANNING TREE PROBLEM
    MALIK, K
    YU, G
    [J]. NETWORKS, 1993, 23 (06) : 525 - 532
  • [10] RAMP for the capacitated minimum spanning tree problem
    Rego, Cesar
    Mathew, Frank
    Glover, Fred
    [J]. ANNALS OF OPERATIONS RESEARCH, 2010, 181 (01) : 661 - 681
12345