In this paper we address the Optimum Communication Spanning Tree Problem.
We present a formulation that uses three index variables and we propose several
families of inequalities, which can be used to reinforce the formulation. Preliminary
computational experiments are very promising.
Fernandez, E. [et al.]. A flow formulation for the optimum communication spanning tree. A: International Network Optimization Conference. "INOC 2013: International Network Optimization Conference, May 20-22, 2013". Tenerife: Universidad de La Laguna, 2013, p. 1-8.