Solving real world problems in network design by means of combinatorial optimization usually begins with finding or developing appropriate models. The application of models for which problem specific efficient heuristic or exact methods exist is favourable. Another desirable key feature of such a model is its flexibility to be adapted to represent the practical requirements. We consider two capacitated problems in locational network design: the capacitated connected facility location problem and the multi-depot ring star problem, the latter ensuring reliability. First we present several relations to other known optimization problems that are generalized by these models. Then we show how to integrate multiple highly relevant side constraints. Besides prize collecting, customer coverage and multiple distributor variants we elaborate problem specific features. The introduced modeling techniques allow the usage of these optimization models with their various existing solution approaches from the literature in a wider context and help to distinguish between related models.