The complexity of optimization problems (Q1107309)

From MaRDI portal
Revision as of 18:34, 18 June 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
The complexity of optimization problems
scientific article

    Statements

    title
    The complexity of optimization problems (English)
    0 references
    author
    Mark W. Krentel
    0 references
    publication date
    1988
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    90C35
    0 references
    zbMATH DE Number
    4064471
    0 references
    zbMATH Keywords
    NP-complete optimization problems
    0 references
    Traveling salesperson
    0 references
    Knapsack
    0 references
    Clique
    0 references
    Coloring
    0 references
    Bin packing
    0 references
    OpenAlex ID
    W2072181151
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1107309&oldid=34790784"
    Powered by MediaWiki