On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithms vol. 18, no. 8 (2025), p. 526-544
1. Verfasser:	Montemanni Roberto
Weitere Verfasser:	Smith, Derek H
Veröffentlicht:	MDPI AG
Schlagworte:	Mathematical programming Lower bounds Integer programming Upper bounds Graph theory Optimization Commodities Variables Approximation Linear programming Algorithms Mixed integer Heuristic Traveling salesman problem
Online-Zugang:	Citation/Abstract Full Text + Graphics Full Text - PDF
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!

Beschreibung
Abstract:	The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In recent years, several heuristic and exact approaches have been proposed to tackle this problem. In this paper, we present a mixed-integer linear program not previously applied to this problem, and we solve it with an open-source solver. Computational results for the benchmark instances commonly adopted in the literature of the problem are reported. The results indicate that the approach we propose obtains results aligned with those of the much more sophisticated approaches available, notwithstanding it being much simpler to implement. During the experimental campaign, six instances were closed for the first time, with nine improved best-known lower bounds and sixteen improved best-known upper bounds over a total of two hundred thirty instances considered.
ISSN:	1999-4893
DOI:	10.3390/a18080526
Quelle:	Engineering Database