The clustered selected-internal Steiner tree problem

Yen Hung Chen

Given a complete graph $G=(V,E)$, with nonnegative edge costs, two subsets $R\subset V$ and $R^{\prime }\subset R$, a partition $\mathcal{R}=\{R_1,R_2,\dots ,R_k\}$ of $R$, $R_i \…