Dilson Lucas Pereira, Alexandre Salles da Cunha. Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem. Networks, 71(1):31-50, 2018. [doi]
@article{PereiraC18,
title = {Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem},
author = {Dilson Lucas Pereira and Alexandre Salles da Cunha},
year = {2018},
doi = {10.1002/net.21787},
url = {https://doi.org/10.1002/net.21787},
researchr = {https://researchr.org/publication/PereiraC18},
cites = {0},
citedby = {0},
journal = {Networks},
volume = {71},
number = {1},
pages = {31-50},
}