Efficient MIP formulation for optimal 1-for-N diversity coding

In the paper we consider a communication network that uses diversity coding in order to achieve reliability. Having a set of demands and a network topology we face a problem of optimal routing of the demands and backup trees, and associations between the demands and the backup trees. We present a compact mixed integer programming (MIP) formulation for the optimization problem, which proves to be more efficient than other approaches that can be found in the literature.