Login / Signup

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

Dilson Lucas PereiraAlexandre Salles da Cunha
Published in: Networks (2018)
Keyphrases
  • lagrangian relaxation
  • computational complexity
  • relaxation algorithm
  • lower and upper bounds
  • np hard
  • data structure
  • branch and bound algorithm