A New 0 – 1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem

The bounded diameter minimum spanning tree (BDMST) problem is NP-hard and appears e.g. in communication network design when considering certain quality of service requirements. Prior exact approaches for the BDMST problem mostly rely on network flow-based mixed integer linear programming and Miller-Tucker-Zemlin-based formulations. This article presents a new, compact 0–1 integer linear programming model, which is further strengthened by dynamically adding violated connection and cycle elimination constraints within a branch-and-cut environment. The proposed approach is empirically compared to two recently published formulations. It turns out to work well in particular on dense instances with tight diameter bounds.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[3]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

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

[5]  Lou Caccetta,et al.  Minimum weight spanning trees with bounded diameter , 1992, Australas. J Comb..

[6]  Lou Caccetta,et al.  Computational methods for the diameter restricted minimum weight spanning tree problem , 1994, Australas. J Comb..

[7]  Luís Gouveia,et al.  Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints , 1995, Comput. Oper. Res..

[8]  S. Voß,et al.  The Steiner tree problem with hop constraints , 1999, Ann. Oper. Res..

[9]  Narsingh Deo,et al.  Random-tree Diameter and the Diameter-constrained MST , 2002, Int. J. Comput. Math..

[10]  Bryant A. Julstrom,et al.  Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem , 2003, SAC '03.

[11]  Rama Akkiraju,et al.  Asynchronous Teams , 2003, Handbook of Metaheuristics.

[12]  Luís Gouveia,et al.  Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees , 2003, Networks.

[13]  Bryant A. Julstrom,et al.  Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys , 2004, GECCO.

[14]  Cristina Requejo,et al.  A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees , 2004, Networks.

[15]  Celso C. Ribeiro,et al.  Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs , 2004, WEA.