In this thesis, we consider several generalized network design problems (NDPs) which belong to the family of NP-hard combinatorial optimization problems. In contrast to classical NDPs, the generalized versions are defined on graphs whose node sets are partitioned into clusters. The goal is to find a subgraph which spans exactly one node from each cluster and also meets further constraints respe...