Abstract
We consider the weight-constrained minimum spanning tree problem which has important applications in telecommunication networks design.We discuss and compare several formulations. In order to strengthen these formulations, new classes of valid inequalities are introduced. They adapt the well-known cover, extended cover and lifted cover inequalities. They incorporate information from the two subsets: the set of spanning trees and the knapsack set. We report computational experiments where the best performance of a standard optimization package was obtained when using a formulation based on the well-known Miller-Tucker-Zemlin variables combined with separation of cut-set inequalities.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
