Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982)

From MaRDI portal
Revision as of 06:13, 9 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
Solving unconstrained binary quadratic programming problem by global equilibrium search
scientific article

    Statements

    title
    Solving unconstrained binary quadratic programming problem by global equilibrium search (English)
    0 references
    author
    J. Herrera
    0 references
    D. Rodríguez-Gómez
    0 references
    publication date
    30 October 2014
    0 references
    zbMATH DE Number
    6362616
    0 references
    zbMATH Keywords
    binary quadratic programming
    0 references
    approximate methods
    0 references
    global equilibrium search
    0 references
    computational experiment
    0 references
    comparative analysis of algorithms
    0 references
    OpenAlex ID
    W2021542890
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q464982&oldid=35419272"
    Powered by MediaWiki