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]

Authors

Dilson Lucas Pereira

This author has not been identified. Look up 'Dilson Lucas Pereira' in Google

Alexandre Salles da Cunha

This author has not been identified. Look up 'Alexandre Salles da Cunha' in Google