An explanation of ordinal optimization: Soft computing for hard problems (Q1818951)

From MaRDI portal
Revision as of 12:58, 5 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126322766, #quickstatements; #temporary_batch_1722855414894)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An explanation of ordinal optimization: Soft computing for hard problems
scientific article

    Statements

    title
    An explanation of ordinal optimization: Soft computing for hard problems (English)
    0 references
    author
    Yu-Chi Ho
    0 references
    publication date
    5 January 2000
    0 references
    zbMATH DE Number
    1384895
    0 references
    zbMATH Keywords
    tutorial
    0 references
    ordinal optimization
    0 references
    system performance evaluation
    0 references
    soft computing
    0 references
    Wikidata QID
    Q126322766
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1818951&oldid=37582290"
    Powered by MediaWiki