Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
type: Item
instance of: scholarly article
title: Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
author: Francesco Carrabs
author: Raffaele Cerulli
author: Rosa Pentangelo
author: Andrea Raiconi
published in: Annals of Operations Research
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7344537
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: conflicting edges
zbMATH Keywords: branch-and-cut
MaRDI profile type: Publication
full work available at URL: s10479-018-2895-y
OpenAlex ID: W2806852865
cites work: Determining a Minimum Spanning Tree with Disjunctive Constraints
cites work: Paths, trees and matchings under disjunctive constraints
cites work: Matrices with the Edmonds-Johnson property
cites work: The minimum cost perfect matching problem with conflict pair constraints
cites work: Trees and Cuts
cites work: The Knapsack Problem with Conflict Graphs
cites work: The maximum flow problem with disjunctive constraints
cites work: A branch and cut algorithm for minimum spanning trees under conflict constraints
cites work: The minimum spanning tree problem with conflict constraints and its variations
DOI: 10.1007/S10479-018-2895-Y
Wikidata QID: Q129760222
description: scientific article; zbMATH DE number 7344537