Abstract
AbstractThis article presents a branch‐and‐cut algorithm for the Generalized Minimum Spanning Tree Problem (GMSTP). Given an undirected graph whose vertex set is partitioned into clusters, the GMSTP consists of determining a minimum‐cost tree including exactly one vertex per cluster. Applications of the GMSTP are encountered in telecommunications. An integer linear programming formulation is presented and new classes of valid inequalities are developed, several of which are proved to be facet‐defining. A branch‐and‐cut algorithm and a tabu search heuristic are developed. Extensive computational experiments show that instances involving up to 160 or 200 vertices can be solved to optimality, depending on whether edge costs are Euclidean or random. © 2004 Wiley Periodicals, Inc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.