An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices

Rafael A. Melo (), Phillippe Samer and Sebastián Urrutia
Additional contact information
Rafael A. Melo: Universidade Federal da Bahia
Phillippe Samer: Universidade Federal de Minas Gerais
Sebastián Urrutia: Universidade Federal de Minas Gerais

Computational Optimization and Applications, 2016, vol. 65, issue 3, No 12, 844 pages

Abstract: Abstract Given a graph $$G=(V,E)$$ G = ( V , E ) , the minimum branch vertices problem consists in finding a spanning tree $$T=(V,E')$$ T = ( V , E ′ ) of G minimizing the number of vertices with degree greater than two. We consider a simple combinatorial lower bound for the problem, from which we propose a decomposition approach. The motivation is to break down the problem into several smaller subproblems which are more tractable computationally, and then recombine the obtained solutions to generate a solution to the original problem. We also propose effective constructive heuristics to the problem which take into consideration the problem’s structure in order to obtain good feasible solutions. Computational results show that our decomposition approach is very fast and can drastically reduce the size of the subproblems to be solved. This allows a branch and cut algorithm to perform much better than when used over the full original problem. The results also show that the proposed constructive heuristics are highly efficient and generate very good quality solutions, outperforming other heuristics available in the literature in several situations.

Keywords: Minimum branch vertices; Spanning tree; Graph decomposition; Heuristics; Branch and cut; Combinatorial optimization (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-016-9850-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:coopap:v:65:y:2016:i:3:d:10.1007_s10589-016-9850-0

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-016-9850-0

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().