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. Copyright © 2018 Inderscience Enterprises Ltd.