A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077)

From MaRDI portal
Revision as of 07:00, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch and cut algorithm for minimum spanning trees under conflict constraints
scientific article

    Statements

    A branch and cut algorithm for minimum spanning trees under conflict constraints (English)
    0 references
    0 references
    0 references
    23 February 2015
    0 references
    optimal trees
    0 references
    conflict constraints
    0 references
    stable set
    0 references
    branch and cut
    0 references

    Identifiers