On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs

Abstract: The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In the last few years several approaches, both heuristic and exact, have been proposed to attack the problem. In this paper we consider a mixed integer linear program never approached before in the context of the problem under investigation, and we solve it with an open-source solver. Computational results on the benchmark instances commonly used in the literature of the problem are reported. The results indicate that the approach we propose, in its simplicity, obtains results aligned with those of the much more sophisticated approaches available. During the experimental campaign 6 instances have been closed for the first time, with 9 improved best-known lower bounds and 16 improved best-known upper bounds over the 230 instances considered.