A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree and whose total edge length is minimum. We design a primal branch-and-cut algorithm that solves instances of the problem to optimality. Primal methods have not been used extensively in the past, and their performance often could not compete with their standard ‘dual’ counterparts. We show that primal separation procedures yield good bounds for the DCMST problem. On several instances, the primal branch-and-cut program turns out to be competitive with other methods known in the literature. This shows the potential of the primal method.

• Type: Conference
• Year: 2007
• Where: WEA
• Authors: Markus Behle, Michael Jünger, Frauke Liers
• Keywords: Algorithms, Primal Branch-and-cut Algorithm, Primal Method, Spanning Tree, WEA 2007