| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651765 | Electronic Notes in Discrete Mathematics | 2013 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
