Degree-Constrained -Minimum Spanning Tree Problem

Algorithm 2

Modified penalty approach to obtain feasible degree-constrained spanning trees.

	Data: a problem instance of the DCMST problem.
	Result: a feasible solution for the DCMST problem. Find a minimum spanning tree using the Kruskal method [53]
	Set
	While (SW) do
	ForEach () do
	Compute the degree of node and save this value in variable
	If () then
	Update all incident arcs for node as follows:
	If (SW) then
	Find a minimum spanning tree using the Kruskal method [53]
	Return feasible solution obtained and its objective function value