The quadratic minimum spanning tree problem: Lower bounds via extended formulations
Sotirov,Renata Verchere,Zoe
Sotirov,Renata
Verchere,Zoe
Abstract
The quadratic minimum spanning tree problem (QMSTP) is the problem of finding a spanning tree of a graph such that the total interaction cost between pairs of edges in the tree is minimized. We first show that the bounding approaches for the QMSTP in the literature are closely related. Then, we exploit an extended formulation for the minimum spanning tree problem to derive a sequence of relaxations for the QMSTP with increasing complexity and quality. The resulting relaxations differ from the relaxations in the literature. Namely, our relaxations have a polynomial number of constraints and can be efficiently solved by a cutting plane algorithm. Moreover our bounds outperform most of the bounds from the literature.
Description
Publisher Copyright: © The Author(s) 2024.
Date
2025-07
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Keywords
quadratic minimum spanning tree problem, linearization problem, extended formulation, Gilmore-Lawler bound
Citation
Sotirov, R & Verchere, Z 2025, 'The quadratic minimum spanning tree problem: Lower bounds via extended formulations', Vietnam Journal of Mathematics, vol. 53, no. 3, pp. 699-720. https://doi.org/10.1007/s10013-024-00694-y
License
info:eu-repo/semantics/openAccess