The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm.

Corinne Feremans Martine Labbé Gilbert Laporte The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. 71-86 2004 43 Networks 2 http://dx.doi.org/10.1002/net.10105 db/journals/networks/networks43.html#FeremansLL04