A branch-and-cut algorithm for the minimum branch vertices spanning tree problem

We model the MBVP as an integer linear program with undirected variables.We derive valid inequalities for it and prove that some of these are facet defining.We develop a hybrid formulation containing undirected and directed variables.We solve both models by branch-and-cut.We report computational results showing the superiority of the hybrid formulation. Given a connected undirected graph G = ( V , E ) , the Minimum Branch Vertices Problem (MBVP) asks for a spanning tree of G with the minimum number of vertices having degree greater than two in the tree. These are called branch vertices. This problem, with applications in the context of optical networks, is known to be NP-hard. We model the MBVP as an integer linear program, with undirected variables, we derive valid inequalities and we prove that some of these are facet defining. We then develop a hybrid formulation containing undirected and directed variables. Both models are solved with branch-and-cut. Comparative computational results show the superiority of the hybrid formulation.

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

[2]  Raffaele Cerulli,et al.  Relations, models and a memetic approach for three degree-dependent spanning tree problems , 2014, Eur. J. Oper. Res..

[3]  Laurence A. Wolsey,et al.  Trees and Cuts , 1983 .

[4]  L. Wolsey,et al.  Chapter 9 Optimal trees , 1995 .

[5]  Miklós Molnár,et al.  Minimization of Branching in the Optical Trees with Constraints on the Degree of Nodes , 2012, ICON 2012.

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

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

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

[9]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

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

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

[12]  Peter Eades,et al.  On Optimal Trees , 1981, J. Algorithms.

[13]  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..

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

[15]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

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

[17]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

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

[19]  Uppaluri S. R. Murty,et al.  Graph Theory with Applications , 1978 .

[20]  Abilio Lucena,et al.  Reformulations and solution algorithms for the maximum leaf spanning tree problem , 2010, Comput. Manag. Sci..