The Linear Multiple Choice Knapsack Problem (Q3893672)

From MaRDI portal
Revision as of 20:52, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Linear Multiple Choice Knapsack Problem
scientific article

    Statements

    title
    The Linear Multiple Choice Knapsack Problem (English)
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    linear multiple choice knapsack problem
    0 references
    fast algorithm
    0 references
    linear programming relaxation
    0 references
    running time complexity
    0 references
    implementation
    0 references
    author
    Eitan Zemel
    0 references

    Identifiers

    zbMATH DE Number
    3700580
    0 references
    OpenAlex ID
    W2157513965
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3893672&oldid=31848844"
    Powered by MediaWiki