Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461)

From MaRDI portal
Revision as of 17:12, 15 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Markov chain methods for the bipartite Boolean quadratic programming problem
scientific article

    Statements

    title
    Markov chain methods for the bipartite Boolean quadratic programming problem (English)
    0 references
    author
    Daniel Karapetyan
    0 references
    Abraham P. Punnen
    0 references
    Andrew J. Parkes
    0 references
    publication date
    29 May 2018
    0 references
    zbMATH Keywords
    artificial intelligence
    0 references
    bipartite Boolean quadratic programming
    0 references
    automated heuristic configuration
    0 references
    benchmark
    0 references
    describes a project that uses
    Paramils
    0 references
    Walksat
    0 references
    PROXIMUS
    0 references
    Hyperheuristics
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C09
    0 references
    68T20
    0 references
    90C20
    0 references
    zbMATH DE Number
    6875786
    0 references
    OpenAlex ID
    W2543350326
    0 references
    arXiv ID
    1605.02038
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1753461&oldid=36393866"
    Powered by MediaWiki