@inproceedings{9f23e1ba275d4b8dbf2861651b3d5958,
title = "An efficient node partitioning algorithm for the capacitated minimum spanning tree problem",
abstract = "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.",
keywords = "Branch and bound, Neighborhood search, Partition, Pruning, Search tree",
author = "Jun Han and Zhaohao Sun and Jinpeng Huai and Xian Li",
year = "2007",
doi = "10.1109/ICIS.2007.56",
language = "英语",
isbn = "0769528414",
series = "Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007",
publisher = "IEEE Computer Society",
pages = "575--580",
booktitle = "Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007",
address = "美国",
note = "6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007, In conjunction with 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007 ; Conference date: 11-07-2007 Through 13-07-2007",
}