Solving Steiner Tree Problem as a MILP

Consider a network \(G(V,E)\), with \(W_0 \subset V\) is a set of focus vertices. Let’s call \(s\in W_0\) the multicast sender and the rest \(W = W_0 \backslash \{s\}\) the multicast receivers. Given the edges of unit weight, how to find the multicast tree that connects \(s\) to \(W\) with... [more]