The following publications are possibly variants of this publication:
- Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problemDilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha. networks, 65(4):367-379, 2015. [doi]
- Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problemDilson Lucas Pereira, Alexandre Salles da Cunha. eor, 284(2):413-426, 2020. [doi]
- Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problemLuidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena. mp, 142(1-2):511-538, 2013. [doi]
- Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree ProblemLuis Henrique Bicalho, Alexandre Salles da Cunha, Abilio Lucena. coap, 63(3):755-792, 2016. [doi]
- Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency CostsDilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha. endm, 41:229-236, 2013. [doi]
- A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree ProblemLeonardo Conegundes Martinez, Alexandre Salles da Cunha. iscopt 2012: 237-248 [doi]