Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118)

From MaRDI portal
Revision as of 09:08, 5 September 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
Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem
scientific article

    Statements

    Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 February 2010
    0 references
    0 references
    0-1 quadratic knapsack problem
    0 references
    linearization
    0 references