IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v334y2026i3p781-797.html

Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph

Author

Listed:
  • Umut İzer, Murat
  • Öncan, Temel
  • Kuban Altınel, İ.

Abstract

Given a connected simple graph with non-negative edge weights and a graph representing conflict relations between the edge pairs, the minimum spanning tree problem with conflict constraints consists of finding a minimum weight spanning tree without any conflicting edge pair. Unlike the ordinary minimum spanning tree problem, this one is known to be NP-hard. We propose a novel branch-and-bound algorithm for the exact solution of the problem. It uses a combinatorial branching rule based on the maximal stable sets of the conflict graph and the information provided by the minimum spanning tree relaxations. According to the results of extensive computational tests, it is possible to say that the new algorithm is very efficient.

Suggested Citation

  • Umut İzer, Murat & Öncan, Temel & Kuban Altınel, İ., 2026. "Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph," European Journal of Operational Research, Elsevier, vol. 334(3), pages 781-797.
    • Handle: RePEc:eee:ejores:v:334:y:2026:i:3:p:781-797
    DOI: 10.1016/j.ejor.2026.03.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221726002456
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2026.03.017?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:334:y:2026:i:3:p:781-797. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.