Computing knapsack solutions with cardinality robustness (Q1926647)

From MaRDI portal
Revision as of 00:23, 6 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
Computing knapsack solutions with cardinality robustness
scientific article

    Statements

    title
    Computing knapsack solutions with cardinality robustness (English)
    0 references
    author
    Naonori Kakimura
    0 references
    Kazuhisa Makino
    0 references
    Kento Seimi
    0 references
    publication date
    28 December 2012
    0 references
    zbMATH Keywords
    knapsack problems
    0 references
    robustness
    0 references
    NP-hardness
    0 references
    FPTAS
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    90C39
    0 references
    90C27
    0 references
    zbMATH DE Number
    6119218
    0 references
    OpenAlex ID
    W1994753237
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1926647&oldid=35314241"
    Powered by MediaWiki