An Improved Branch-and-Bound Method for Maximum Monomial Agreement (Q2815448)

From MaRDI portal
Revision as of 19:13, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
An Improved Branch-and-Bound Method for Maximum Monomial Agreement
scientific article

    Statements

    An Improved Branch-and-Bound Method for Maximum Monomial Agreement (English)
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    branch and bound
    0 references
    combinatorial optimization
    0 references
    machine learning
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references