A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3104695357 / rank
 
Normal rank

Revision as of 21:28, 19 March 2024

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