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

From MaRDI portal
Revision as of 18:12, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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

    Identifiers

    0 references
    0 references
    0 references
    0 references