Fast Approximation Algorithms for Knapsack Problems (Q3861164)

From MaRDI portal
Revision as of 17:54, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    author
    Eugene L. Lawler
    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

    Identifiers

    DOI
    10.1287/moor.4.4.339
    0 references
    zbMATH DE Number
    3662882
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3861164&oldid=17477720"
    Powered by MediaWiki