Solving Steiner Tree Problem as a MILP

Consider a network , with is a set of focus vertices. Let’s call the multicast sender and the rest the multicast receivers. Given the edges of unit weight, how to find the multicast tree that connects to with minimum total edge weight? This is a generalized minimal spanning tree problem,... [more]