Models and cutting-plane strategies for the tree-star problem

Abstract

Let G = (V, E) be a connected graph of set of nodes V and set of edges E. Let T = (VT, ET), with VT = V and ET ⊆ E, be a spanning tree of G. With each edge e ∈ E there is associated a routing cost ceR if e connects two internal nodes of T; or an access cost ceA, otherwise. The problem is to determine a spanning tree (tree-star) considering access and routing edge costs of minimum cost. We present two new formulations and a cutting-plane algorithm. One is based on a classical spanning tree model. The novelty relies on the way we capture access and routing edges depending on the internal nodes of the tree. The second model is completely new and is based on the concept of dicycle to represent routing edges as quadratic variables that are linearized accordingly to obtain a tree-star equivalent structure. Computational experiments performed on benchmark instances for models PFlow and PHR from the literature and for the new ones (PST and PDC) indicate that this problem is very difficult to deal with. Only a very small number of instances was solved to optimality in a given time limit. Models PDC and PHR, improved with cutting-plane strategies, although they do not solve optimally almost instances, performed better for this problem, with the dicycle-based model presenting the smallest gaps for instances for which some feasible solution was found.