The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning tree subject to an additional constraint stating that the number of nodes in each subtree pending from a given root node is not greater than a given number Q. Gouveia and Martins proposed a hop-indexed flow model for the CMSTP. This formulation is a generalization of a well known single-commodity flow model proposed by Gavish. The linear programming (LP) bound of the new formulation has produced the best bounds for a set of tests (tests with the root in the corner of the grid of nodes) which have been characterized as hard by most of the available lower-bounding schemes. The deficiency of the new formulation is the range of variation of the extra hop index which leads to storage problems when instances with 80 nodes are tried. We propose several levels of aggregation of the original formulation, yielding a hierarchy of hop-indexed LP models with fewer variables than the original model and which are weaker than the LP relaxation of the original formulation but still stronger than the LP relaxation of the single-commodity flow model. This hierarchy suggests an iterative method for computing lower bounds for the CMSTP. It iteratively transforms a given model into a more disaggregated model with a tighter relaxation. Reduction tests performed in a given iteration can be used to eliminate variables from the models arising in later iterations. Computational results assessing the efficiency of the iterative method are reported. The results are taken from a set of benchmark instances with 41 and 81 nodes and two new instances with 121 nodes.
