Title:
|
Lagrangean bounds for the optimum communication spanning tree problem
|
Author:
|
Contreras, I.; Fernández Aréizaga, Elena; Marín, Alfredo
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa; Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació |
Abstract:
|
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. |
Subject(s):
|
-Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica -Linear programming -Heuristic algorithms -Integer programming -Combinatorial optimization -Programació lineal -Heurística -Programació entera -Optimització combinatòria |
Rights:
|
|
Document type:
|
Article - Published version Article |
Published by:
|
Springer Verlag
|
Share:
|
|