An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277)

From MaRDI portal
Revision as of 15:22, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/mp/Dyer84, #quickstatements; #temporary_batch_1731505720702)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An O(n) algorithm for the multiple-choice knapsack linear program
scientific article

    Statements

    An O(n) algorithm for the multiple-choice knapsack linear program (English)
    0 references
    0 references
    1984
    0 references
    linear algorithm
    0 references
    computational complexity
    0 references
    analysis of algorithms
    0 references
    multiple choice knapsack problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references