Abstract
Abstract In this paper, two formulations for the Min-degree Constrained Minimum Spanning Tree Problem, one based on undirected Subtour Elimination Constraints and the other on Directed Cutset inequalities, are discussed. The quality of the Linear Programming bounds provided by them is addressed and a Branch-and-cut algorithm based on the strongest is investigated. Our computational experiments indicate that the method compares favorably with other exact and heuristic approaches in the literature, in terms of solution quality and execution times. Several new optimality certificates and new best upper bounds are provided here.
Sign-in/Register to access full text options 
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.
