A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs. Issue 1 (27th November 2020)

• Record Type: Journal Article
• Authors: Carrabs, Francesco; Gaudioso, Manlio
• Is Part Of: Networks. Volume 78:Issue 1(2021)
• Page Start: 32
• Page End: 45
• Publication Date: 2020-11-27
• Subjects: conflict constraints -- conflicting edges -- Lagrangian approach -- spanning tree; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.22009
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract: This article addresses the minimum spanning tree problem with conflicting edge pairs, a variant of the classical minimum spanning tree where, given a list of conflicting edges, the goal is to find the cheapest spanning tree with no edges in conflict. We adopt a Lagrangian relaxation approach together with a dual ascent and a subgradient procedure to find tight lower bounds on the optimal solution. The algorithm is also equipped with a heuristic approach which provides an upper bound by removing the conflicts from possible infeasible solutions met during the calculation of the lower bounds. The computational results, carried out on benchmark instances, show that the proposed algorithm finds the optimal solutions on several instances. Moreover, the lower bounds it provides are much more accurate than ones provided by other Lagrangian approaches available in the literature and they are computed in much less time.