Summary: The capacitated \(m\)-ring-star problem (CRSP) is the problem of designing a set of rings that pass through a central depot and through some transition points and/or customers, and then assigning each nonvisited customer to a visited point or customer. The number of customers visited and connected to a ring is bounded by an upper limit: the capacity of the ring. The objective is to minimize the total routing cost plus assignment costs. The problem has several applications in telecommunication network design and transportation planning. In addition, closely related versions to the CRSP involving different graph topologies and objective functions have been recently studied by several authors. The recent literature shows that effective methods for solving these class of difficult optimization problems are based on the combination of column-and-cut generation techniques. In particular, the effectiveness of these methods strongly depend on the qualities and complexities of the associated pricing problems. In this paper, we investigate different pricing strategies based on dynamic programming algorithms for the CRSP that can also be adapted to deal with different graph topologies. We describe a general bounding procedure based on column-and-cut generation that is used to test the effectiveness of the different pricing strategies. We report an extensive computational analysis on CRSP benchmark instances from the literature and on newly generated instances for its generalization to the multi-depot case, the multi-depot ring-star problem (MDRSP). The results obtained show the effectiveness of the pricing strategies proposed and that tight lower bounds can be computed for instances involving up to 431 nodes.