Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244)

From MaRDI portal
Revision as of 03:02, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Approximate and exact algorithms for the fixed-charge knapsack problem
scientific article

    Statements

    Approximate and exact algorithms for the fixed-charge knapsack problem (English)
    0 references
    0 references
    16 November 2005
    0 references
    Branch-and-bound
    0 references
    Fixed-charge
    0 references
    Knapsack problems
    0 references

    Identifiers