A polyhedral study of the cardinality constrained knapsack problem (Q1404231)

From MaRDI portal
Revision as of 18:42, 21 March 2024 by Openalex240321050300 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polyhedral study of the cardinality constrained knapsack problem
scientific article

    Statements

    A polyhedral study of the cardinality constrained knapsack problem (English)
    0 references
    20 August 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed-integer programming
    0 references
    knapsack problem
    0 references
    cardinality constrained programming
    0 references
    branch-and-cut
    0 references
    0 references