Article history: Received January 16, 2017 Received in revised format: May 22, 2017 Accepted July 23, 2017 Available online July 25, 2017 This paper deals with the degree constrained k-cardinality minimum spanning tree (k-MSTPD) problem defined on a connected, edge weighted and undirected graph. The aim of this problem is to determine the least weighted… (More)