Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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.
['Jun Han', 'Zhaohao Sun', 'Jinpeng Huai', 'Xian Li']
I am writing a research paper on a idea An Efficient Node Partitioning Algorithm for the Capacitated Minimum Spanning Tree Problem
[{"from": "human", "value": "I am writing a research paper on a idea An Efficient Node Partitioning Algorithm for the Capacitated Minimum Spanning Tree Problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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."}]