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

Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach Ann Oper Res https://doi.org/10.1007/s10479-018-2895-y S.I.: CODIT2017-COMBINATORIAL OPTIMIZATION Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 1 1 Francesco Carrabs · Raffaele Cerulli · 1 1 Rosa Pentangelo · Andrea Raiconi © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract 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. Keywords Minimum spanning tree · Conflicting edges · Branch-and-cut 1 Introduction The minimum spanning tree problem with conflicting edge pairs (MSTC) is a very recent variant of the classical minimum spanning tree (MST) problem. Given a connected, undi- rected and edge-weighted graph, as well as a set of edges pairs in conflict with each other, a feasible http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Operations Research Springer Journals

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

Loading next page...
 
/lp/springer_journal/minimum-spanning-tree-with-conflicting-edge-pairs-a-branch-and-cut-Ziy87Typvn
Publisher
Springer US
Copyright
Copyright © 2018 by Springer Science+Business Media, LLC, part of Springer Nature
Subject
Business and Management; Operations Research/Decision Theory; Combinatorics; Theory of Computation
ISSN
0254-5330
eISSN
1572-9338
D.O.I.
10.1007/s10479-018-2895-y
Publisher site
See Article on Publisher Site

Abstract

Ann Oper Res https://doi.org/10.1007/s10479-018-2895-y S.I.: CODIT2017-COMBINATORIAL OPTIMIZATION Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach 1 1 Francesco Carrabs · Raffaele Cerulli · 1 1 Rosa Pentangelo · Andrea Raiconi © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract 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. Keywords Minimum spanning tree · Conflicting edges · Branch-and-cut 1 Introduction The minimum spanning tree problem with conflicting edge pairs (MSTC) is a very recent variant of the classical minimum spanning tree (MST) problem. Given a connected, undi- rected and edge-weighted graph, as well as a set of edges pairs in conflict with each other, a feasible

Journal

Annals of Operations ResearchSpringer Journals

Published: May 29, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off