Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach

In this paper, we show a branch-and-cut approach to solve the minimum spanning tree problem with conflicting edge pairs. This is a NP-hard variant of the classical minimum spanning tree problem, in which there are mutually exclusive edges. We introduce a new set of valid inequalities for the problem...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research Jg. 298; H. 1-2; S. 65 - 78
Hauptverfasser: Carrabs, Francesco, Cerulli, Raffaele, Pentangelo, Rosa, Raiconi, Andrea
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.03.2021
Springer
Springer Nature B.V
Schlagworte:
Algorithms
Authorship
Branch & bound algorithms
Branch and bound algorithms
Business and Management
Combinatorial optimization
Combinatorics
Decision tree
Edge detection (Image processing)
Graph theory
Management
Mathematical models
Mathematical programming
Methods
Nonlinear programming
Operations research
Operations Research/Decision Theory
S.I.: CoDIT2017-Combinatorial Optimization
Theory of Computation
Varieties
Italy
Branch-and-cut
Conflicting edges
Minimum spanning tree
ISSN:0254-5330, 1572-9338
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we show a branch-and-cut approach to solve the minimum spanning tree problem with conflicting edge pairs. This is a NP-hard variant of the classical minimum spanning tree problem, in which there are mutually exclusive edges. We introduce a new set of valid inequalities for the problem, based on the properties of its feasible solutions, and we develop a branch-and-cut algorithm based on them. Computational tests are performed both on benchmark instances coming from the literature and on some newly proposed ones. Results show that our approach outperforms a previous branch-and-cut algorithm proposed for the same problem.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-018-2895-y