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

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.

[1]  Abstract mechanical connection and Abelianreconstruction for almost Kähler manifolds , 2000, math/0009027.

[2]  Alfredo Marín.  Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem , 2015, Eur. J. Oper. Res..

[3]  Pavol Hell,et al.  Spanning Trees with Bounded Number of Branch Vertices , 2002, ICALP.

[4]  Raffaele Cerulli,et al.  Lower and upper bounds for the spanning tree with minimum branch vertices , 2013, Comput. Optim. Appl..

[5]  Mauricio G. C. Resende,et al.  An edge-swap heuristic for generating spanning trees with minimum number of branch vertices , 2013, Optimization Letters.

[6]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.

[7]  Gilbert Laporte,et al.  A branch-and-cut algorithm for the minimum branch vertices spanning tree problem , 2017, Comput. Oper. Res..

[8]  Barbaros Ç. Tansel,et al.  Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints , 2010, Comput. Oper. Res..

[9]  Mercedes Landete,et al.  Decomposition methods based on articulation vertices for degree-dependent spanning tree problems , 2017, Computational Optimization and Applications.

[10]  Vitor Nazário Coelho,et al.  An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints , 2016, Eur. J. Oper. Res..

[11]  Sebastián Urrutia,et al.  An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices , 2016, Comput. Optim. Appl..

[12]  Ivan C. Martins,et al.  Efficient algorithms for cluster editing , 2016, J. Comb. Optim..

[13]  José Elias Claudio Arroyo,et al.  ILS Heuristics for the Single-Machine Scheduling Problem with Sequence-Dependent Family Setup Times to Minimize Total Tardiness , 2016, J. Appl. Math..

[14]  Jens M. Schmidt.  A simple test on 2-vertex- and 2-edge-connectivity , 2012, Inf. Process. Lett..

[15]  Alexandre Salles da Cunha,et al.  The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm , 2014, Discret. Appl. Math..

[16]  André Rossi,et al.  New heuristics for two bounded-degree spanning tree problems , 2012, Inf. Sci..

[17]  Raffaele Cerulli,et al.  Bounded-degree spanning tree problems: models and new algorithms , 2009, Comput. Optim. Appl..

[18]  Jitamitra Desai,et al.  A Generalization of the Minimum Branch Vertices Spanning Tree Problem , 2018, ISCO.

[19]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[20]  Mauricio G. C. Resende,et al.  An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem , 2011, SEA.