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]
- Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problemDilson Lucas Pereira, Alexandre Salles da Cunha. networks, 71(1):31-50, 2018. [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]