An exact algorithm for multi-constrained minimum spanning tree problem

T. Jayanth Kumar and Purusotham Singamsetty

International Journal of Mathematics in Operational Research, 2018, vol. 12, issue 3, 317-330

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. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=90800 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:12:y:2018:i:3:p:317-330

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().