The following publications are possibly variants of this publication:
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithmCorinne Feremans, Martine Labbé, Gilbert Laporte. networks, 43(2):71-86, 2004. [doi]
- On generalized minimum spanning treesCorinne Feremans, Martine Labbé, Gilbert Laporte. eor, 134(2):457-458, 2001. [doi]
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problemSelene Silvestri, Gilbert Laporte, Raffaele Cerulli. cor, 81:322-332, 2017. [doi]