An exact and heuristic approach for the d-minimum branch vertices problem

Jorge Moreno (), Yuri Frota () and Simone Martins ()
Additional contact information
Jorge Moreno: Universidade Federal Fluminense
Yuri Frota: Universidade Federal Fluminense
Simone Martins: Universidade Federal Fluminense

Computational Optimization and Applications, 2018, vol. 71, issue 3, No 9, 829-855

Abstract: Abstract Given a connected graph $$G=(V,E)$$ G = ( V , E ) , the d-Minimum Branch Vertices (d-MBV) problem consists in finding a spanning tree of G with the minimum number of vertices with degree strictly greater than d. We developed a Miller–Tucker–Zemlin based formulation with valid inequalities for this problem. The results obtained for different values of d show the effectiveness of the proposed method, which has solved several instances faster than previous methods. Also, an heuristic is proposed for this problem, that was tested on several instances of the Minimum Branch Vertices problem, which is the d-MBV problem, when $$d = 2$$ d = 2 .

Keywords: Spanning tree; Branch vertice; Integer programming; Metaheuristic (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-018-0027-x 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:71:y:2018:i:3:d:10.1007_s10589-018-0027-x

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

DOI: 10.1007/s10589-018-0027-x

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 ().