An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem

• Type: Article in International Conference Proceedings Book
• Date: 2011

Authors

Diego M Silva (Author) Other; Ricardo M A Silva (Author) Other; Gerald R Mateus (Author) Other; Jose F Goncalves (Author) FEP; Mauricio G C Resende (Author) Other; Paola Festa (Author) Other

Conference proceedings International

Title: EXPERIMENTAL ALGORITHMS

Pages: 421-433

10th International Symposium on Experimental Algorithms

Kolimpari, GREECE, MAY 05-07, 2011

Indexing

ISI Web of Knowledge - 6 Citations

Scopus - 6 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-007-YAX

DOI: 10.1007/978-3-642-20662-7_36

Abstract (EN): This paper presents a new approach to solve the NP-complete minimum branch vertices problem (MBV) introduced by Gargano et. al[1]. In spite of being a recently proposed problem in the network optimization literature, there are some heuristics to solve it [3]. The main contribution of this paper consists in a new heuristic based on the iterative refinement approach proposed by Deo and Kumar [2]. 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 13