Fast Approximation Algorithms for Knapsack Problems (Q3861164)

From MaRDI portal
Revision as of 22:54, 21 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast Approximation Algorithms for Knapsack Problems
scientific article

    Statements

    title
    Fast Approximation Algorithms for Knapsack Problems (English)
    0 references
    publication date
    1979
    0 references
    zbMATH Keywords
    NP-complete problems
    0 references
    knapsack problem
    0 references
    subset sum problem
    0 references
    fully polynomial approximation schemes
    0 references
    approximate solution
    0 references
    author
    Eugene L. Lawler
    0 references

    Identifiers

    zbMATH DE Number
    3662882
    0 references
    Wikidata QID
    Q94701723
    0 references
    OpenAlex ID
    W2113195911
    0 references
    DOI
    10.1287/MOOR.4.4.339
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3861164&oldid=39355299"
    Powered by MediaWiki