Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem

Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha. Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem. Networks, 65(4):367-379, 2015. [doi]

@article{PereiraGC15,
  title = {Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem},
  author = {Dilson Lucas Pereira and Michel Gendreau and Alexandre Salles da Cunha},
  year = {2015},
  doi = {10.1002/net.21580},
  url = {http://dx.doi.org/10.1002/net.21580},
  researchr = {https://researchr.org/publication/PereiraGC15},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {65},
  number = {4},
  pages = {367-379},
}