Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Minimum-weight spanning tree algorithms a survey and empirical study
Computers and Operations Research
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
Computers and Operations Research
Savings based ant colony optimization for the capacitated minimum spanning tree problem
Computers and Operations Research
Computational experience with minimum spanning tree algorithms
Operations Research Letters
Operations Research Letters
Design of capacitated minimum spanning tree with uncertain cost and demand parameters
Information Sciences: an International Journal
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
Computers and Operations Research
Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.01 |
Given a centralized undirected graph with costs associated with its edges, the capacitated minimum spanning tree problem is to find a minimum cost spanning tree of the given graph, subject to a capacity constraint in all subtrees incident in the central node. As the problem is NP-hard, we propose an enhanced version of the well-known second order algorithm, described in [Karnaugh M. A new class of algorithms for multipoint network optimization. IEEE Transactions on Communications 1976;COM-24:500-5.]. The original version of this algorithm is based on a look-ahead strategy, used for a tentative inclusion of a constraint to the problem, performed in each iteration. In the new enhanced version, we propose the inclusion of look-behind steps, which can be seen as the reverse of the look-ahead procedure. Therefore and using some memory features, the method can continue even when facing the traditional stopping criterion of the original algorithm. Computational experiments showing the effectiveness of the new method on benchmark instances are reported.