Title: An exact algorithm for multi-constrained minimum spanning tree problem

Authors: T. Jayanth Kumar; Purusotham Singamsetty

Addresses: Department of Mathematics, School of Advanced Sciences, VIT University, Vellore – 632014, Tamil Nadu, India ' Department of Mathematics, School of Advanced Sciences, VIT University, Vellore – 632014, Tamil Nadu, India

Abstract: This paper deals with a variant of minimum spanning tree problem with multiple constraints, which includes degree, weight and budgeting constraints simultaneously together. To model the problem, a zero-one programming is incorporated. An exact solution procedure called pattern recognition technique-based lexi-search algorithm is developed. A suitable numerical illustration is given to check the applicability of the developed algorithm. Furthermore, the algorithm is programmed in C and tested with randomly generated hard instances, computational results are also reported. The overall results reveal that the proposed algorithm is fairly proficient in the sense of both acquiring the optimal solutions and computational time.

Keywords: multi-constrained minimum spanning tree; lexi-search algorithm; pattern recognition technique; weight constraint; degree constraint; budgeting constraint.

DOI: 10.1504/IJMOR.2018.090800

International Journal of Mathematics in Operational Research, 2018 Vol.12 No.3, pp.317 - 330

Received: 27 Apr 2016
Accepted: 22 Aug 2016
Published online: 28 Mar 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article