Fast Approximation Algorithms for Knapsack Problems (Q3861164)

From MaRDI portal
Revision as of 13:00, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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

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