Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21787
Abstract: Given a complete and undirected graph G, the adjacent only quadratic minimum spanning tree problem (AQMSTP) consists of finding a spanning tree that minimizes a quadratic function of its adjacent edges. The strongest AQMSTP linear… read more here.
Keywords: branch cut; lagrangian relaxation; adjacent quadratic; problem ... See more keywords