Alteração - Atendimento do Repositório Institucionalclique aqui para acessar a portaria
Please use this identifier to cite or link to this item:
|metadata.artigo.dc.title:||Lower bounds and exact algorithms for the quadratic minimum spanning tree problem|
|metadata.artigo.dc.creator:||Pereira, Dilson Lucas|
Cunha, Alexandre Salles da
|metadata.artigo.dc.subject:||Quadratic 0-1 programming|
|metadata.artigo.dc.identifier.citation:||PEREIRA, D. L.; GENDEREAU, M.; CUNHA, A. S. da. Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. Computers & Operations Research, New York, v. 63, p. 149-160, Nov. 2015.|
|metadata.artigo.dc.description.abstract:||We address the quadratic minimum spanning tree problem (QMSTP), the problem of finding a spanning tree of a connected and undirected graph such that a quadratic cost function is minimized. We first propose an integer programming formulation based on the reformulation–linearization technique (RLT). We then use the idea of partitioning spanning trees into forests of a given fixed size and obtain a QMSTP reformulation that generalizes the RLT model. The reformulation is such that the larger the size of the forests, the stronger lower bounds provided. Thus, a hierarchy of formulations is obtained. At the lowest hierarchy level, one has precisely the RLT formulation, which is already stronger than previous formulations in the literature. The highest hierarchy level provides the convex hull of integer feasible solutions for the problem. The formulations introduced here are not compact, so the direct evaluation of their linear programming relaxation bounds is not practical. To overcome that, we introduce two lower bounding procedures based on Lagrangian relaxation. These procedures are embedded into two parallel branch-and-bound algorithms. As a result of our study, several instances in the literature were solved to optimality for the first time.|
|Appears in Collections:||DCC - Artigos publicados em periódicos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.