An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem
This paper presents a new approach to solve the NP-complete minimum branch vertices problem (MBV) introduced by Gargano et. al . In spite of being a recently proposed problem in the network optimization literature, there are some heuristics to solve it . The main contribution of this paper consists in a new heuristic based on the iterative refinement approach proposed by Deo and Kumar . The experimental results suggest that this approach is capable of finding solutions that are better than the best known in the literature. In this work, for instance, the proposed heuristic found better solutions for 78% of the instances tested. The heuristic looks very promising for the solution of problems related with constrained spanning trees.
KeywordsConstrained spanning trees Branch vertices Iterative refinement
Unable to display preview. Download preview PDF.
- 4.Boldon, B., Deo, N., Kumar, N.: Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine. Technical Report CS-TR-95-02, Department of Computer Science, University of Central Florida, Orlando, FL (1995)Google Scholar