Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881)

From MaRDI portal
Revision as of 22:31, 5 July 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
Exact algorithm for concave knapsack problems: linear underestimation and partition method
scientific article

    Statements

    Exact algorithm for concave knapsack problems: linear underestimation and partition method (English)
    0 references
    0 references
    23 January 2006
    0 references
    concave knapsack problem
    0 references
    domain cut
    0 references
    domain partition
    0 references
    linear underestimation
    0 references
    nonlinear integer programming
    0 references

    Identifiers