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

From MaRDI portal
Revision as of 09:52, 17 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
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