Journal
NETWORKS
Volume 71, Issue 1, Pages 31-50Publisher
WILEY
DOI: 10.1002/net.21787
Keywords
adjacent only quadratic minimum spanning tree problem; projection; branch-and-cut algorithms; Lagrangian relaxation
Funding
- CNPq [408868/2016-3, 303677/2015-5, 471464/2013-9, 200493/2014-0]
- FAPEMIG [CEX - PPM-00187-15]
Ask authors/readers for more resources
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 integer programming formulation in the literature works on an extended variable space, using exponentially many decision variables assigned to the stars of G. In this article, we characterize three families of facet defining inequalities by investigating the projection of that formulation onto the space of the canonical linearization variables. On the algorithmic side, we introduce four new branch-and-bound algorithms. Three of them are branch-and-cut algorithms based on the inequalities characterized by projection. The fourth is based on a Lagrangian relaxation scheme, also devised for the star reformulation. Two of the branch-and-cut algorithms provide very good results, almost always dominating the previously best algorithm for the problem. The Lagrangian relaxation based branch-and-bound algorithm provides even better results. It manages to solve all previously solved AQMSTP instances in the literature in about one tenth of the time needed by its competitors. (c) 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 71(1), 31-50 2018
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available