Rights accessRestricted access - publisher's policy
This paper considers the Optimum Communication Spanning Tree Problem.
An integer programming formulation that yields tight LP bounds is proposed.
Given that the computational effort required to obtain the LP bounds considerably
increases with the size of the instances when using commercial solvers, we propose
a Lagrangean relaxation that exploits the structure of the formulation. Since feasible
solutions to the Lagrangean function are spanning trees, upper bounds are also obtained.
These bounds are later improved with a simple local search. Computational
experiments have been run on several benchmark instances from the literature. The
results confirm the interest of the proposal since tight lower and upper bounds are
obtained, for instances up to 100 nodes, in competitive computational times.
CitationContreras, I.; Fernández, E.; Marín, A. Lagrangean bounds for the optimum communication spanning tree problem. "TOP", 2010, vol. 18, núm. 1, p. 140-157.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com