Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.